goldman sachs logo
Goldman Sachs· Analyst

📌 My Interview Experience at Goldman Sachs – Analyst Position (April 2025)

Posted
5 May 2025
307 reads

Summary

I was selected for the Analyst role at Goldman Sachs after an extremely positive interview experience. My process involved multiple technical rounds focusing on Data Structures & Algorithms, Low-Level Design, and a final Hiring Manager discussion, all of which I cleared successfully.

How it went

Verdict: Selected âś…

Hi everyone!
I’m thrilled to share that I’ve been selected for the Analyst role at Goldman Sachs. I wanted to document my entire experience here in the hope it helps someone else preparing for the same.


🧠 Round 1 – CoderPad (April 4)

This was a DSA-based live coding round. The level was easy to medium.

Questions:

  1. Trapping Rain Water
  2. Decode Ways

I was able to complete both problems in 30 minutes. The interviewer asked a small follow-up (don’t remember exactly, but it was easy).

After that, we discussed my projects and work at my current firm.

⏩ Got the call same day that I was selected for Super Day on April 8.


🧠 Round 2 – Super Day DSA Round (2 Interviewers)

Both interviewers were super chill and encouraging!

Q1: Tree-Based Problem

I was given a binary tree and asked to print the diagonal traversal of it.

Example:

        1
      /   \
     2     3
    / \   / \
   4   5 7   6

Expected Output:
1 2 4  
3 5 7  
6

Q2: Stack & Queue Implementation

Deep discussion on:

  • Implementing stack using queue
  • Queue using stack
  • Handling operations with only one stack or one queue

Many follow-ups but I was able to answer all.


🧠 Round 3 – Resume + LLD + DP

Again two interviewers.

Resume Discussion

Since I had mentioned Kafka and automation scripts, we had a detailed discussion on that.

Q1: LLD – Task Scheduler

Design a task scheduler where tasks can only start after their dependencies are completed.
Follow-up: Add priority-based execution.

Q2: DP Problem

Very similar to Predict The Winner
Follow-up: Print the steps taken by the winner.


🧠 Round 4 – DSA + Logical Reasoning

Q1: Burst Balloons

Q2: Logical Array Problem

Given a sorted array:

Original:    [1, 3, 5, 7, 10, 12, 14, 16]  
Transformed: [1, 7, 5, 3, 10, 16, 14, 12]  
             (Even indices unchanged; odd indices swapped randomly)

Questions:

  • Is 5 present? If yes, at what index?
  • Is 16 present? If yes, at what index?
  • Is 11 present?

With hints from the interviewer, I was able to crack it.
Honestly, couldn’t solve this without hints, but the interviewers were really helpful.


🧠 Round 5 – HM Round

The Hiring Manager was extremely friendly.

We discussed:

  • Why I’m looking to switch
  • Why Goldman Sachs
  • Some situational and behavioral questions
  • Discussed CTC, location preference, etc.

đź’¬ Final Thoughts

This was an extremely positive experience for me.
Each interviewer was well-prepared, respectful, and genuinely curious.
One bad interviewer can ruin an interview process – but I had none here.
Felt like a two-way conversation, not an interrogation.


🎉 Verdict: SELECTED

I'm beyond grateful for this community – you all have helped me so much during preparation.

Questions asked (8)

  1. 01

    Trapping Rain Water

    Data Structures & Algorithms

    Open the problem
  2. 02

    Decode Ways

    Data Structures & Algorithms

    Open the problem
  3. 03

    Binary Tree Diagonal Traversal

    Data Structures & Algorithms

    I was given a binary tree and asked to print the diagonal traversal of it.

    Example:

            1
          /   \
         2     3
        / \   / \
       4   5 7   6
    
    Expected Output:
    1 2 4  
    3 5 7  
    6
    
  4. 04

    Implement Stack using Queue and Queue using Stack

    Data Structures & Algorithms

    Deep discussion on:

    • Implementing stack using queue
    • Queue using stack
    • Handling operations with only one stack or one queue

    Many follow-ups but I was able to answer all.

  5. 05

    Design Task Scheduler with Dependencies and Priority

    System Design

    Design a task scheduler where tasks can only start after their dependencies are completed.
    Follow-up: Add priority-based execution.

  6. 06

    Predict The Winner with Steps

    Data Structures & Algorithms

    Very similar to Predict The Winner
    Follow-up: Print the steps taken by the winner.

    Open the problem
  7. 07

    Burst Balloons

    Data Structures & Algorithms

    Open the problem
  8. 08

    Search in Transformed Sorted Array

    Data Structures & Algorithms

    Given a sorted array:

    Original:    [1, 3, 5, 7, 10, 12, 14, 16]  
    Transformed: [1, 7, 5, 3, 10, 16, 14, 12]  
                 (Even indices unchanged; odd indices swapped randomly)
    

    Questions:

    • Is 5 present? If yes, at what index?
    • Is 16 present? If yes, at what index?
    • Is 11 present?

    With hints from the interviewer, I was able to crack it.
    Honestly, couldn’t solve this without hints, but the interviewers were really helpful.

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!