Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso FactSet (New York, NY) nel mese di nov 2016
Colloquio
I applied online through our school's online career board. Extremely fast turnaround with notification for interview in less than a week. I met with an software engineer in-person for a 1:1 interview on campus. Standard technical interview, asked about data structures (in my case hash tables) followed by a coding question. The interviewer was fairly enthusiastic and open to discussing the ins and outs of the company.
Domande di colloquio [1]
Domanda 1
Asked me how to check if a string is a palindrome. Followed up by asking how to check if inserting, deleting, or replacing a character would result in a palindrome.
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.
