Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 dias. Fui entrevistado pela FactSet (Durgapur, West Bengal) em set. de 2015
Entrevista
Factset recently visited our college for on campus recruitment. All questions are based on algorithms and data structures. Total process consists of 4 rounds,a written ,two personal interviews and a hr round.In written round you are supposed to write pseudo codes for given questions (pen and paper).In interview rounds,you are tested majorly in C,algorithms and datastructures. HR round is normal, you are asked general hr questions .
Perguntas de entrevista [1]
Pergunta 1
Write psuedocode to print all non boundary elementelements in a tree without using extra memory.
Write psuedocode to separate cyclic stringstrings from a set of strings.
Algorithm to print immediate greater number with same digits.
Print greater of two given numbers without using if.
Check whether a given linked list is a palindrome without using extra memory.
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.
