Me postulé a través de una facultad o universidad. Acudí a una entrevista en FactSet (San Francisco, CA) en nov 2016
Entrevista
My initial screening interview happened at a job fair. It was very easy and the interviewer only asked the ways of traversing a binary search tree as well as 1 or 2 personal questions.
The on-site wasa scheduled shortly thereafter and consisted of 5 interviews. There was typical coding interview, a design interview, and a code review interview, then a lunch with two engineers, and then a Hiring Manager interview and an HR interview. The interviews were all fine, although the 3 technical ones had two interviewers each, which threw me off
Overall the process was fine, kind of long but everyone was nice. Although they primarily use C++, they allowed me to do my interview in Java.
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.
