Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela FactSet (Nova Deli) em set. de 2018
Entrevista
Total of 4 rounds. 1 written pen paper round of 3 coding questions.
2 Difficult Tecnical rounds which was 4 hrs least combined . They were testing it to the limit and most importantly the approach.
These Questions change all the time and do not repeat as it simply depends on the interviewee.
1 HR interview consisted of general questions and was also a form of a pressure test, atleast for me it was.
Overall the process was difficult than most which speaks volumes about the company work force.
Perguntas de entrevista [1]
Pergunta 1
In Total 8 Coding questions (Competitive Level).gfg for ref.
Candidatei-me por meio de recrutador(a). O processo levou 2 semanas. Fui entrevistado pela FactSet (Londres, Inglaterra) em fev. de 2026
Entrevista
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
Perguntas de entrevista [2]
Pergunta 1
System Design:
Design google docs with version control.
Fiz uma entrevista na empresa FactSet (Londres, Inglaterra).
Entrevista
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
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 3 semanas. Fui entrevistado pela FactSet (Hyderābād) em dez. de 2025
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.
