J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez FactSet (Raipur, Chhattisgarh) en nov. 2020
Entretien
The interview consisted of two technical interviews and one HR round. The level of questions rises from easy to difficult throughout the rounds. The interview was held on hackerrank codepair where you have to live code and run it. The HR round was chill. You just have to be yourself and answer the questions honestly.
Questions d'entretien [1]
Question 1
1. Overlapping intervals 2. Find palindrome sequence in tree 3. Leetcode house robber 3 problem and some more which I don't remember but were easy to medium questions.
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.
