Ich habe mich über eine Hochschule oder Universität beworben. Der Vorgang dauerte 1 Tag. Vorstellungsgespräch absolviert im Sept. 2012 bei FactSet (Hyderabad)
Vorstellungsgespräch
In written round(1st round), 12 programming questions were asked. Not very hard. Then two technical interviews. Most of the questions were on linked lists. Nearly all subjects were covered(C, Data Structures,DBMS,OS) for Computer Science people and for others only data structures. Then finally an HR interview(just for formality).
Fragen im Vorstellungsgespräch [1]
Frage 1
Write a program for adding 2 large numbers with each digit represented as a node of linked list.(in technical interview)
Ich habe mich über einen Personalvermittler beworben. Der Vorgang dauerte 2 Wochen. Vorstellungsgespräch absolviert im Feb. 2026 bei FactSet (London, England)
Vorstellungsgespräch
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
Fragen im Vorstellungsgespräch [2]
Frage 1
System Design:
Design google docs with version control.
Vorstellungsgespräch absolviert bei FactSet (London, England)
Vorstellungsgespräch
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
Ich habe mich über eine Hochschule oder Universität beworben. Der Vorgang dauerte 3 Wochen. Vorstellungsgespräch absolviert im Dez. 2025 bei FactSet (Hyderabad)
Vorstellungsgespräch
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.
Fragen im Vorstellungsgespräch [1]
Frage 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.
