Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 3 días. Acudí a una entrevista en FactSet en feb 2016
Entrevista
It was a on campus interview. When the interview began, interviewers introduced themselves, and then they asked some basic questions about hash table. Then I was asked something about my experience on my resume.
Coding on paper, they will give you some hints and explanation, the question is easy as long as you have reviewed basic algorithms and data structures.
The interviewers were friendly. But I wasn't well prepared so I didn't pass.
Preguntas de entrevista [1]
Pregunta 1
Some questions about my experience on my resume.
Basic questions about binary tree and hash table.
Solicité el puesto a través de un captador. El proceso duró 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
Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 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.
