Factset

Role: SDE Intern

College: Not Specified (On-Campus)

Interview Date: Not Specified (experience published July 23, 2025)

Interview Type: On-Campus

Result: Selected

Difficulty: Medium

Rounds: 3 rounds

Topics Asked: Data Structures (Priority Queue, Maps), Algorithms (Binary Search, Recursion), Problem Solving, Coding

Experience:

The interview process was described as difficult but enjoyable, focusing on programming, problem-solving, and learning capabilities.

Round 1: Online Assessment

This was a timed coding test with three questions of medium difficulty. Candidates needed to correctly answer at least two to proceed. The round required practical and quick thinking for logical and mathematical problems.

Round 2: Technical Interview 1

A 60-minute technical interview where the interviewer asked questions while the candidate solved them.

• Question 1: Related to binary search, finding the smallest divisor of a given number.
• Question 2: Involved recursion, specifically printing subsequences of a string.
• Question 3: Calculating the total of substrings that are longer than a given minimum, shorter or equal to a given length, and have a maximum of unique characters.

The candidate's knowledge of data structures and problem-solving skills were key to clearing this round.

Round 3: Technical Interview 2

Another 60-minute technical interview with a different set of questions.

• Question 1 (Priority Queue): Solve a problem using a priority queue data structure, specifically inserting phones in priority order to always have a priority phone.
• Question 2 (Maps): Efficiently use maps to store and retrieve data.

This round focused on data structures and their application to complex problems.