Me postulé en persona. El proceso tomó 3 semanas. Acudí a una entrevista en FactSet (Norwalk, CT) en mar 2013
Entrevista
Initially met at a career fair. Sat down the next day for a light technical interview involving some basic question on object oriented design and a very simple programming question.
I got an e-mail about 1-2 weeks afterwards with an invitation to do an in person interview. They flew me out to NYC and got me a driving service from NYC to Norwalk. The next day, I had several interviews.
A demo, a code review, an OO game design interview, an algorithmic design interview, and a couple non-technical interviews.
Preguntas de entrevista [1]
Pregunta 1
Others had been saying atoi() was a common question, as was a binary tree question. I did not see either.
Me postulé a través de un reclutador. El proceso tomó 2 semanas. Acudí a una entrevista en FactSet (Londres, Inglaterra) en feb 2026
Entrevista
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
Preguntas de entrevista [2]
Pregunta 1
System Design:
Design google docs with version control.
Acudí a una entrevista en FactSet (Londres, Inglaterra)
Entrevista
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
Me postulé a través de una facultad o universidad. El proceso tomó 3 semanas. Acudí a una entrevista en FactSet (Hyderabad) en dic 2025
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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.
