Candidatei-me por meio de recrutador(a). O processo levou 4 dias. Fui entrevistado pela FactSet (Hyderābād) em abr. de 2015
Entrevista
Quite a great experience. The recruiter called me and explained about the opening which was directly related to my skill-set. Recruiter had been amazing and very helpful throughout the process. Had a round on phone, then was called to the Hyderabad Office (DLF, Gachibowli) for process. First was a written round with questions related to algorithms, parsing, regular expressions, simple Natural Language Processing and Machine Learning. Had a 1:1 interview, and another panel interview after lunch. Was called next day for another 1:1 round and a phone interview with their Director of Engineering.
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.
