Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 3 giorni. Ho sostenuto un colloquio presso FactSet (Bhubaneshwar) nel mese di lug 2021
Colloquio
Came to our college in 1st round asked 4 questions .The duration of the test was 1.5 hours.
9 students were selected from 89.I was able to clear the 1s round by answering 3 out of 4 questions.
Domande di colloquio [1]
Domanda 1
1st question was basic coding question in which we had to check if we can obtain asked string from given string by swapping positions
2nd question was basic 0/1 knapsack problem
3rd question was to write sql query
4th question was related to java exceptions
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso FactSet (Londra, Inghilterra) nel mese di feb 2026
Colloquio
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
Domande di colloquio [2]
Domanda 1
System Design:
Design google docs with version control.
Ho sostenuto un colloquio presso FactSet (Londra, Inghilterra)
Colloquio
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
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso FactSet (Hyderabad) nel mese di dic 2025
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
