Goldman Sachs - Associate - Interview Experience

goldman sachs logo
goldman sachs
Associate3 years
July 8, 2025 • 6 reads

Summary

I interviewed for an Associate role at Goldman Sachs with almost 3 years of experience. After completing the OA and CoderPad rounds, I provided solutions to specific LeetCode problems. However, my interview process was unfortunately cancelled after a poor feedback from the Data Structures round.

Full Experience

I’m presently working at a good product-based company and have almost 3 years of experience.

Round 1 : OA (2 hr)

It consisted to 3 leetcode medium level questions. Couldn't remember exact questions.

Round 2 : CoderPad Interview (1 hr)

Question 1: It was a medium-level question involving hashmaps, but I couldn't find the exact one on LeetCode. Question 2: https://leetcode.com/problems/minimum-path-sum/description/

Rounds 3, 4 & 5 are kind of loop interviews scheduled on the same day.

Round 3 : Data Structures (1 hr)

Question 1: https://leetcode.com/problems/find-original-array-from-doubled-array/description/ Question 2: https://leetcode.com/problems/magnetic-force-between-two-balls/description/

Immediately after Round 3, I received an email stating that the remaining rounds had been cancelled. When I reached out to the HR, she mentioned that the feedback from Round 3 was very poor.

Just FYI Round 4 is Software Engineering Practices (1 hr) Round 5 is Software Design and Architecture (1 hr) Round 6 is Hiring Manager Round

Good luck to all!

Interview Questions (2)

Q1
Find Original Array From Doubled Array
Data Structures & AlgorithmsMedium

An integer array original is transformed into a doubled array changed by appending twice the value of every element in original, and then randomly shuffling the resulting array. Given changed, return original if changed is a doubled array. If changed is not a doubled array, return an empty array or [-1]. The elements in original can be returned in any order.

Q2
Magnetic Force Between Two Balls
Data Structures & AlgorithmsMedium

You have n baskets and m balls. You want to place m balls into n baskets such that the minimum magnetic force between any two balls is maximized. Given an integer array position where position[i] is the position of the i-th basket, return the maximum possible minimum magnetic force.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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