Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 dias. Fui entrevistado pela FactSet (Bhopal) em ago. de 2016
Entrevista
Whole process comprises of 4 rounds:
1st round written pen and paper round consist of 3 questions they have 10, 15, and 25 marks.
After this round 35 students were selected out of 103 students.
2nd round Ask some basic question on binary search, sql query, oops concept and then ended the interview by asking question on string.
This round is also elimination round
3rd round asked question how to abstract name, email id, mobile number and skills from unstructured data and to count number of palindromic sub-string of any length in a given length.
I am eliminated after this round.
After this round students are called for HR round.
GeeksforGeeks is definitely going to help you a lot.
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.
