Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso FactSet (Norwalk, CT) nel mese di feb 2014
Colloquio
Had a brief phone interview that involved a discussion of OOP and writing code in C++. Was invited onsite, where there were a series of interviews, each one-on-one. One was a C++ code review. Another was about designing a game/simulator and addressing its challenges. The third focused on data structures and algorithms. The experience was mostly positive, and I heard a decision less than a week later, but I have yet to receive the promised travel reimbursement. I can understand a delay in this process, but no one from HR has replied to my inquiries about it. Very unprofessional.
Domande di colloquio [1]
Domanda 1
Nothing was extremely difficult, but I was mildly and happily surprised that there was a segment fully devoted to OOD.
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso FactSet (Londra, Inghilterra) nel mese di feb 2026
Colloquio
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
Domande di colloquio [2]
Domanda 1
System Design:
Design google docs with version control.
Ho sostenuto un colloquio presso FactSet (Londra, Inghilterra)
Colloquio
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
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso FactSet (Hyderabad) nel mese di dic 2025
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
