Acudí a una entrevista en FactSet (Norwalk, CT) en ene 2014
Entrevista
Multiple technical interviews
* Code Review - given the Chromeum Embedded Framework open source, find as many bugs and design issues as possible
* Design - design a 4 dimensional maze, its graphical representation, and find the shortest distance to the end
* Algorithms
* Given 2 sorted lists of numbers M and N, find the k highest values of M(i) + N(j) in O(k)
* Given a weighted graph, create an algorithm to find the a path that hits all points given as input, with another set of inputs that limits the shortest path to take between the nodes
* Turn an array of characters that represents a number, into an integer
15
Otras opiniones sobre las entrevistas para el puesto de Software Engineer en FactSet
Solicité el puesto a través de un captador. El proceso duró 2 semanas. Acudí a una entrevista en FactSet (Londres, Inglaterra) en feb 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
Preguntas de entrevista [2]
Pregunta 1
System Design:
Design google docs with version control.
Acudí a una entrevista en 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
Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 3 semanas. Acudí a una entrevista en FactSet (Hyderabad) en dic 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.
Preguntas de entrevista [1]
Pregunta 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.
