Le processus a pris 2 semaines. J'ai passé un entretien chez FactSet en juil. 2010
Entretien
I was first contacted by email and asked to provide a short piece of sample code before they could set up a technical phone interview. You can expect to discuss the code you had provided along with design choices and possible ways to improve it.
After the phone interview, I was scheduled for an on site interview consisting of an office tour by HR, a product demo by a software engineer, three technical 2:1 interviews, lunch, and an interview with a software director. The first two technical interviews covered OOP and algorithms while in the last I was asked to debug code in c, c++, or java. They give their final hiring decision within 24 hours
Questions d'entretien [1]
Question 1
Given a binary tree, write an algorithm to find the first common ancestor of any two nodes
J'ai postulé via un recruteur. Le processus a pris 2 semaines. J'ai passé un entretien chez FactSet (Londres, Angleterre) en févr. 2026
Entretien
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
Questions d'entretien [2]
Question 1
System Design:
Design google docs with version control.
J'ai passé un entretien chez FactSet (Londres, Angleterre)
Entretien
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
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 3 semaines. J'ai passé un entretien chez FactSet (Hyderâbâd) en déc. 2025
Entretien
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.
Questions d'entretien [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.