Goldman Sachs Associate Experience - July 2025
- Result
- Rejected
- Location
- India
- Experience
- 4 years
- Posted
- 27 Aug 2025
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:
- First Unique Character in a String: I used a two-pass fixed-size frequency array approach, achieving O(N) time complexity.
- 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:
- Reverse Single-Linked-List in k-Groups
- Longest Increasing Subsequence
SuperDay Round 2: Software Engineering Practices or DSA (1 hour)
I was given one main question for this round:
- 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)
- 01
First Unique Character in a String
Data Structures & Algorithms · Easy
Open the problemGiven a string
s, find the first non-repeating character in it and return its index. If it does not exist, return -1. - 02
Trapping Rain Water
Data Structures & Algorithms · Hard
Open the problemGiven
nnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. - 03
Reverse Nodes in k-Group
Data Structures & Algorithms · Hard
Open the problemGiven the
headof a linked list, reverse the nodes of the listkat a time, and return the modified list. - 04
Longest Increasing Subsequence
Data Structures & Algorithms · Medium
Open the problemGiven an integer array
nums, return the length of the longest strictly increasing subsequence. - 05
Shortest Path with K Hops/Free Edges
Data Structures & Algorithms · Hard
Open the problemFind the shortest path in a graph, allowing for up to
Kspecial 'hops' or 'free edges' that might have different cost considerations.