Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso FactSet (Visakhapatnam) nel mese di set 2015
Colloquio
day1: 1st round written test on a) c&c++,b) ds, os concepts c) database.. day 2 : 2 nd round techincial 3rd round techincial .. total questions are pure techincial covering ds, advanced concepts of ds, c++,dbms . out of 350 from 1st round only 35 were selected for 2nd day 2nd round interview, and out of 35 only 11 for 3 rd round and only 6 got the offer..all rounds are elimination, very tough, needs total grip on the concepts. gud pac, gud experience. best interview exp .. the only company i have seen with proper interview process..feeling bad for not get selected but will try hard...
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.
