Microsoft SDE Intern Interview Experience
💼 LTIMindtree Interview Experience (On-Campus) | Fresher | 2026
Salesforce SMTS | Interview Experience | Rejected
JPMC | SDE2 (Associate) - Java Backend - Interview Experience + Compensation
Microsoft - SDE2 - Coding Round
Goldman Sachs | Associate | Offer
Summary
I cleared the interview process for an Associate role at Goldman Sachs, which included an online assessment, a DSA round, and a Superday with several data structures, algorithms, and puzzle-based questions.
Full Experience
-> Online Assessement: 1 hard + 1 medium DSA.
-> DSA ROUND: 2 Easy + medium Leetcode question.
Superday:
Round 1
-
Merge 3 Sorted Lists in One Go
Problem: Merge three sorted lists into one sorted list efficiently.
Related LeetCode:
Merge k Sorted Lists (Leetcode #23)
Related GFG:
-
Queue Class with Basic Methods Provided
You were given a basic Queue class and asked to extend it in two ways:
a: Find Queue with Minimum Size
Task: Among multiple queues, identify the one with the smallest size using a minimal approach.
b: Find Queue with Minimum Sum of Elements
Task: Among multiple queues, find the one with the minimum sum of elements efficiently.
Related GFG Conceptual Reference:
(Custom implementation questions—no exact LeetCode link; more of a design + logic problem.)
Round 2
-
Find the First Missing Positive Number in an Array
Problem: Return the smallest missing positive integer from an unsorted integer array.
Related LeetCode:
First Missing Positive (Leetcode #41)
Related GFG:
-
Puzzle: Horse Race Problem
This is typically a variation of the 25 horses / 5 tracks / find top 3 fastest with minimal races puzzle.
Common format:
You have 25 horses and only 5 tracks. You can race up to 5 horses at a time.
No stopwatch, only relative order of each race is known.
Find the minimum number of races required to identify the top 3 fastest horses.
Related Puzzle Reference:
Interview Questions (4)
You were given a basic Queue class and asked to extend it in two ways: a: Find Queue with Minimum Size - Task: Among multiple queues, identify the one with the smallest size using a minimal approach. b: Find Queue with Minimum Sum of Elements - Task: Among multiple queues, find the one with the minimum sum of elements efficiently. (Custom implementation questions—no exact LeetCode link; more of a design + logic problem.)
This is typically a variation of the 25 horses / 5 tracks / find top 3 fastest with minimal races puzzle. Common format: You have 25 horses and only 5 tracks. You can race up to 5 horses at a time. No stopwatch, only relative order of each race is known. Find the minimum number of races required to identify the top 3 fastest horses.