Le processus a pris 4 semaines. J'ai passé un entretien chez FactSet (Norwalk, CT) en oct. 2011
Entretien
First round of 1:1 interview on campus after career fair. Focused on normal Computer Science coursework and mainly C++. Got onsite interview call within 2 days. Scheduled onsite interview after 20 days.
On-site interview consisted of 5 rounds. Starting with breakfast and software presentation by company market analysts at company headquarters. Followed by 5 rounds of interview with 5 different persons. Each round was focused on - code walk-through, OOPs concepts, Algorithm, HR and Lead interview.
People are good and friendly. Did not felt like giving an interview. More of like discussion between interviewer and interviewee.
HR called after 2 days to inform I was selected and gave 15 days to confirm.
Questions d'entretien [1]
Question 1
Code Walk-through. Was given an option to choose between C, C++ and Java. 3 pages of code, having some design, syntax and logical defects
J'ai postulé via un recruteur. Le processus a pris 2 semaines. J'ai passé un entretien chez FactSet (Londres, Angleterre) en févr. 2026
Entretien
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
Questions d'entretien [2]
Question 1
System Design:
Design google docs with version control.
J'ai passé un entretien chez FactSet (Londres, Angleterre)
Entretien
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
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 3 semaines. J'ai passé un entretien chez FactSet (Hyderâbâd) en déc. 2025
Entretien
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.
Questions d'entretien [1]
Question 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.