Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso FactSet (New York, NY) nel mese di nov 2018
Colloquio
Starts off with a phone interview. Then moves onto onsite which is about 6 hours long. There are about 6 rounds on the onsite that consists of overview of the products/goals/mission, code review round, design round, data structures round, conversation with director of engineering and finally short chat with the recruiter.
Domande di colloquio [1]
Domanda 1
Code Review: Linked List Class with errors/flaws. You need to find them and fix.
Design: Design an mp3 player.
Data Structures: How to reverse a string (using O(1) memory)? Find nth to last node on a linked list? Balance a binary tree? There's only one duplicate item in the array, how would you find it?
The interviewer for the code review round realized towards the end that he forgot to give me a page that contained code.
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.
