I applied through college or university. The process took 1 day. I interviewed at FactSet (Norwalk, CT) in Sep 2011
Interview
A demonstration of software product, three technical interviews, lunch and another interview with the manager.
Each interview has two interviewers.
First interview is code review.
Second interview: 1. write a function to convert string to int.
2. Basic OOP concepts in C++, such as virtual function, constructor, destructor, deep copy, shallow copy, polymorphism.
Third interview: 1. The same question as 2.4 in CareerCup_Top_150_Questions 4th
2. hashtable and BST
Interview questions [1]
Question 1
write a function to convert string to int.
Basic OOP concepts in C++, such as virtual function, constructor, destructor, deep copy, shallow copy, polymorphism.
The same question as 2.4 in CareerCup_Top_150_Questions 4th
hashtable and BST
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.
