Goldman Sachs | Associate | 3 YOE | Bengaluru | Reject
- Location
- Bengaluru
- Experience
- 3 years
- Posted
- 3 Jul 2025
Summary
I interviewed for an Associate role at Goldman Sachs in Bengaluru, comprising multiple coding rounds and a technical discussion on Java Concurrency and JVM. Despite solving most coding problems, I received a rejection.
How it went
Round 1 : 2 hour Hackerrank test with 2 Easy-Medium questions. I was able to successfully solve both questions within 20-25 minutes.
Round 2 : Coderpad round Q1. https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/ Q2. Similar to https://leetcode.com/problems/trapping-rain-water/description/
Superday Round 3 : Q1. https://leetcode.com/problems/single-element-in-a-sorted-array/description/ Q2. https://leetcode.com/problems/combination-sum-ii/description/
Fumbled badly in the first question.
Round 4 : Q1. https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/description/ Q2. https://leetcode.com/problems/word-ladder/description/
5-6 questions related to Java Concurrency (Runnable, Callable, ExecuterService, Thread Lifecycle) and JVM Garbage Collection.
Got a Rejection Mail after this round.
Edit : Updated the title to clarify YOE :D.
Questions asked (7)
- 01
Find Minimum in Rotated Sorted Array
Data Structures & Algorithms · Medium
Open the problemGiven a sorted array that has been rotated at some pivot unknown to you beforehand, find the minimum element.
- 02
Trapping Rain Water (Similar)
Data Structures & Algorithms · Hard
Open the problemA problem similar to trapping rain water, likely involving computing how much water can be trapped between elevation map bars.
- 03
Single Element in a Sorted Array
Data Structures & Algorithms · Medium
Open the problemYou are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Find this single element.
- 04
Combination Sum II
Data Structures & Algorithms · Medium
Open the problemGiven a collection of candidate numbers and a target number, find all unique combinations in candidates where the candidate numbers sum to target. Each number in candidates may only be used once.
- 05
Number of Substrings Containing All Three Characters
Data Structures & Algorithms · Medium
Open the problemGiven a string s consisting only of characters 'a', 'b' and 'c'. Return the number of substrings that contain at least one occurrence of all these characters 'a', 'b' and 'c'.
- 06
Word Ladder
Data Structures & Algorithms · Hard
Open the problemGiven two words, beginWord and endWord, and a dictionary wordList, return the number of words in the shortest transformation sequence from beginWord to endWord.
- 07
Java Concurrency & JVM Garbage Collection
Other
5-6 questions related to Java Concurrency (Runnable, Callable, ExecuterService, Thread Lifecycle) and JVM Garbage Collection.