I applied through college or university. The process took 1 day. I interviewed at FactSet (Hyderābād) in Aug 2012
Interview
There were 3 technical rounds.
1st round - This lasted for 45 min. 2 people interviewed me. Started by asking in-depth questions about my projects. Next, questions were mostly on DBMS like how to go about the construction of huge databases like that of gmail. Some related SQL commands and about the management of primary and foreign keys in the construction of the gmail DB. Asked 1 easy puzzle.
2nd round - This lasted for 1 and a half hour. 1 person interviewed me. It was pretty difficult. Asked conceptual questions from OS, DBMS, DSA. Asked about 2 -3 puzzles.
3rd round - This was semi HR and semi Technical. This lasted for 20 minutes. 1 person interviewed me. Asked about why I like computer science and what I like in it. Gave a C# code and asked me to understand the code and asked few questions on it. Concepts were similar to JAVA. The question was on priority queues.
There were very very friendly. Hope this helps.
Interview questions [1]
Question 1
Write the algorithm for dining Philosopher's problem.
I applied through a recruiter. The process took 2 weeks. I interviewed at FactSet (London, England) in Feb 2026
Interview
3 rounds of interviews.
1 behavioural interview, 1 technical interview (leetcode), 1 system design interview
all interviews were online.
Increasing word count to thirty. This is annoying bla bla bla bla bla
Interview questions [2]
Question 1
System Design:
Design google docs with version control.
Standard with 4 rounds including a phone interview and a HR interview. The product demo is the intro, after which a tech and HR rounds occur back to back. Usually takes 3.5 hours after the 1 hour phone interview
I applied through college or university. The process took 3 weeks. I interviewed at FactSet (Hyderābād) in Dec 2025
Interview
It was a very casual interview. I was told the interview would start at 8:45 AM but it started around 10 AM. The interviewer was very friendly and walked me through my thought process towards solving the given problem. There were two rounds of interviews, purely technical though I did not get shortlisted for the second round.
Interview questions [1]
Question 1
Given an array of integers, and an integer k, what is the length of the longest subarray of the same consecutive integers we can get if we can remove any k elements from the array.
