El proceso tomó 2 semanas. Acudí a una entrevista en FactSet (New York, NY) en mar 2011
Entrevista
First round of interview was over phone, a half an hour conversation with the group manager, then an on-site interview was promptly scheduled.
On-site interview consisted of an hour long written test, followed by four one-on-one interviews with team members, with a lunch in the middle.
Questions in the test varied from trivial (e.g., what's the difference between an array and a hash) to ones that clearly had no completely correct solution (e.g,, write a program that extracts all people's names from text). Each interviewer would then go over the test digging into one question or another.
Preguntas de entrevista [1]
Pregunta 1
Extract all names from text using regular expressions.
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.