I applied through university. The process took 5 days. I interviewed at FactSet
Interview
Call from the HR after dropping my resume at the career fair. Had a phone interview round. Was asked about bitwise operations. All sorts of combinations.
Got a call onsite in a day got scheduled for 2 days later. Initial round was a code review. Told them the necessary details like memory leaks and how I would restructure the code. Followed by a design interview which also went well. Then had another technical round. Asked about dynamic programming. I found it difficult. I could identify the problem but could not give a solution.
Had lunch with some folks, went well, then an HR round and a round with the Director.
All went well, easy questions, a little tricky but can get through. Unless your luck's real hard and you end up with a DP problem and cant solve it as per their satisfaction.
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 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.
