Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso FactSet (Londra, Inghilterra) nel mese di dic 2019
Colloquio
The interview process was enjoyable overall. It consisted of one phone interview and an on-site assessment.
The phone interview was an hour chat starting with self-intro, motivation, and go over a recent technical project, then some basic CS questions like principles of OOP, stack vs heap, recursion vs iteration, complexities, etc.
The on-site consisted of 4 rounds:
- half/an hour intro of the company and products by an employee
- technical round on algorithms and data structure
- technical round on recent project, then debugging and optimising two written codes, one in Java and one in assembly
- HR and senior manager on motivation, competency, and logistics
The decision was made in 15 minutes after the on-site. The HR and all interviewers were very professional and helpful.
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.
