goldman sachs logo
Goldman Sachs· Associate

Goldman Sachs Associate Experience  - July 2025

Result
Rejected
Location
India
Experience
4 years
Posted
27 Aug 2025
404 reads

Summary

I interviewed for an Associate position at Goldman Sachs in July 2025. The process included an online assessment, a CoderPad interview, and a SuperDay consisting of multiple rounds. Unfortunately, I was rejected after the second SuperDay round because I could not fully complete one of the coding questions within the time limit.

How it went

Background

  • I have 4 years of experience and am based in India.
  • A recruiter initially reached out to me through Naukri.
  • The team I was interviewing for was Compliance Engineering.

Interview Structure

The overall interview process was structured as follows:

  • Screening: HackerRank Online Assessment (2 hours)
  • Round 0: CoderPad Interview (1 hour)
  • SuperDay Rounds (Onsite Loop): These were scheduled for the same day.
    • Round 1: Data Structures (1 hour)
    • Round 2: Software Engineering Practices/DSA (1 hour)
    • Round 3: Software Design and Architecture (1 hour) - I did not proceed to this round.
    • Round 4: Hiring Manager Round - I did not proceed to this round.

Screening: HackerRank OA (2 hours)

I completed the HackerRank Online Assessment within 15–20 minutes. The questions were relatively easy.

Round 0: CoderPad Interview (1 hour)

This round involved two coding questions:

  1. First Unique Character in a String: I used a two-pass fixed-size frequency array approach, achieving O(N) time complexity.
  2. Trapping Rain Water: My chosen approach was a two-pointer scan from both ends, updating bounds and accumulating water.

I successfully coded the most optimal solutions for both problems, and all test cases passed.

SuperDay Round 1: Data Structures (1 hour)

This round focused on Data Structures with two problems:

  1. Reverse Single-Linked-List in k-Groups
  2. Longest Increasing Subsequence

SuperDay Round 2: Software Engineering Practices or DSA (1 hour)

I was given one main question for this round:

  1. Shortest Path with K Hops/Free Edges

Unfortunately, I could only code this single question within the allocated hour, which meant I did not proceed to Round 3.

Verdict

I received a rejection after SuperDay Round 2.

Questions asked (5)

  1. 01

    First Unique Character in a String

    Data Structures & Algorithms · Easy

    Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1.

    Open the problem
  2. 02

    Trapping Rain Water

    Data Structures & Algorithms · Hard

    Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

    Open the problem
  3. 03

    Reverse Nodes in k-Group

    Data Structures & Algorithms · Hard

    Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.

    Open the problem
  4. 04

    Longest Increasing Subsequence

    Data Structures & Algorithms · Medium

    Given an integer array nums, return the length of the longest strictly increasing subsequence.

    Open the problem
  5. 05

    Shortest Path with K Hops/Free Edges

    Data Structures & Algorithms · Hard

    Find the shortest path in a graph, allowing for up to K special 'hops' or 'free edges' that might have different cost considerations.

    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!