I applied through university. I interviewed at FactSet (New York, NY) in Nov 2018
Interview
Starts off with a phone interview. Then moves onto onsite which is about 6 hours long. There are about 6 rounds on the onsite that consists of overview of the products/goals/mission, code review round, design round, data structures round, conversation with director of engineering and finally short chat with the recruiter.
Interview questions [1]
Question 1
Code Review: Linked List Class with errors/flaws. You need to find them and fix.
Design: Design an mp3 player.
Data Structures: How to reverse a string (using O(1) memory)? Find nth to last node on a linked list? Balance a binary tree? There's only one duplicate item in the array, how would you find it?
The interviewer for the code review round realized towards the end that he forgot to give me a page that contained code.
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.