goldman sachs logo
Goldman Sachs· Associate

Goldman Sachs | Associate | Offer

Posted
2 May 2025
320 reads

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.

How it went

-> Online Assessement: 1 hard + 1 medium DSA.

-> DSA ROUND: 2 Easy + medium Leetcode question.

Superday:

Round 1

  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:

    Merge K sorted linked lists

  2. 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:

    Implement Queue using Python

    (Custom implementation questions—no exact LeetCode link; more of a design + logic problem.)

Round 2

  1. 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:

    Find the smallest positive missing number

  2. 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:

    25 Horses Puzzle (GFG)

    25 Horses Puzzle Explanation

Questions asked (4)

  1. 01

    Merge 3 Sorted Lists

    Data Structures & Algorithms

    Merge three sorted lists into one sorted list efficiently.

    Open the problem
  2. 02

    Extend Queue Class: Find Min Size and Min Sum

    Data Structures & Algorithms

    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.)

    Open the problem
  3. 03

    First Missing Positive Number in Array

    Data Structures & Algorithms

    Return the smallest missing positive integer from an unsorted integer array.

    Open the problem
  4. 04

    Horse Race Puzzle

    Other

    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.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Goldman Sachs recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!