Goldman Sachs Interview Experience | Associate Role | Transaction Banking | Sep 2025 | Bangalore
- Result
- Rejected
- Location
- bangalore
- Experience
- 3 years
- Posted
- 17 Sept 2025
Summary
I interviewed with Goldman Sachs for an Associate role, undergoing an Online Assessment, two coding rounds, and a Super Day comprising DSA, Low-Level Design, and High-Level Design rounds. Despite performing well in coding and some DSA, I was ultimately rejected after struggling in the High-Level Design round.
How it went
I applied directly on the Goldman Sachs portal, and soon after, a recruiter contacted me, providing a HackerRank test link for the first round.
1st Round - Online Assessment
This round consisted of two medium-difficulty questions. I successfully cleared this round and was invited for the next.
2nd Round - Coding (Codepad)
In this round, the interviewer presented two coding challenges. I was expected to provide the most optimal code. I successfully solved both problems, and all test cases passed within 30 minutes. This performance led to my selection for the Super Day.
Super Day Rounds
A week later, I participated in the Super Day, which involved three rounds conducted on the same day.
1st Round (DSA)
There were two interviewers in this round, each asking one question. I was able to partially solve the first design question but fully completed the second array problem with all test cases passing.
2nd Round (Low-Level Design)
This round began with discussions about my projects, followed by questions on NoSQL and SQL databases. I was then asked to design a system for a restaurant to track its most frequently ordered items. Additionally, there were Java-specific questions covering topics like the static keyword, garbage collection, and multithreading.
3rd Round (High-Level Design)
The final round involved designing a monitoring tool. Unfortunately, I struggled significantly in this round, partly because I felt my previous LLD round hadn't gone well, and I found myself unable to articulate a comprehensive solution.
Verdict
Ultimately, I was rejected after the Super Day rounds.
Questions asked (6)
- 01
First Unique Character in a String
Data Structures & Algorithms · Easy
Find the first non-repeating character in a string and return its index. If no such character exists, return -1.
- 02
Search in Rotated Sorted Array
Data Structures & Algorithms · Medium
Find the integer in a rotated sorted array. The array was originally sorted in ascending order but was rotated at some unknown pivot point.
- 03
O(1) Data Structure for Update, Return, and Change All Values
Data Structures & Algorithms · Hard
Design a data structure that supports three operations: updating a specific value, returning a specific value, and changing all values currently in the data structure, all with O(1) time complexity.
- 04
Maximum Sum from Array Ends
Data Structures & Algorithms · Medium
Given an array and an integer
k, you can only take values either from the front or the back of the array. The goal is to output the maximum sum achievable by taking exactlykvalues. - 05
LLD: Restaurant's Most Frequent Ordered Items
System Design · Medium
Design a system for a restaurant to track and identify its most frequently ordered items. The design should consider data structures, APIs, and overall system architecture for a low-level implementation.
- 06
HLD: Design a Monitoring Tool
System Design · Hard
Design a high-level architecture for a generic monitoring tool. Consider aspects like data collection, storage, visualization, alerting, and scalability.