I applied through college or university. The process took 1 day. I interviewed at FactSet (Troy, NY) in Feb 2016
Interview
Interview was meant to be a half hour, we went a little over but the time really flew. Started off by going over some of the technical experiences I listed on my resume, then the interviewer went down through a checklist and asked me about some basic things regarding the position (e.g. do i have any experience/preference towards front end vs. back end development). After that there were a couple of basic programming knowledge questions and a quick code question.
Interview questions [1]
Question 1
Describe what's happening in memory when you operate on an std::vector vs. an array?
Give a real world example of why inheritance is useful in OOP.
Programming question: given a vector of numbers and an index, reverse the order of all numbers in that vector up to said index (e.g. [1,2,3,4,5], 2 becomes [3,2,1,4,5]).
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.
