Goldman Sachs Associate - Interview Experience
- Result
- Rejected
- Experience
- 3 years
- Posted
- 27 Sept 2025
Summary
I interviewed for an Associate Data Engineer role at Goldman Sachs with 3 years of experience. The process involved a HackerRank assessment, a CoderPad round, and a multi-round Super Day, but I was unfortunately rejected after the second round of the Super Day.
How it went
A recruiter reached out to me for a Data Engineer (Hadoop/Spark) Associate position, given my 3 years of experience. The interview process began with a HackerRank round, followed by a CoderPad round. The final stage was a Super Day, which comprised multiple elimination rounds. Despite making it to the Super Day, I was ultimately rejected after the second round, as I didn't perform as well as required.
Questions asked (5)
- 01
Forest Analysis: Unconnected Trees and Max Children Root
Data Structures & Algorithms · Medium
Given a list of child-parent relations representing trees in a forest, I needed to determine the number of unconnected trees. Additionally, I had to identify the root of the tree that contained the maximum number of children. A Depth-First Search (DFS) approach was suggested.
- 02
Maximize Same Elements in Sorted Array with K Increments
Data Structures & Algorithms · Medium
I was given a sorted array of numbers and an integer value
k. My task was to increment any number(s) in the array, using a total of at mostkincrements. The objective was to find the maximum number of identical elements that could be achieved in the array after these operations. A sliding window technique was hinted at. - 03
Task Scheduler with Cooling Period
Data Structures & Algorithms · Medium
Given an array of tasks, a CPU can process one task per cycle. However, similar tasks must be performed after a
kcooling period cycles. I needed to determine the minimum CPU cycles required to complete all tasks. The problem statement suggested using a Heap or a Queue. - 04
Implement TTL-based Cache
System Design · Medium
I was asked to implement a Time-To-Live (TTL) based cache. This involved designing a cache mechanism where key-value pairs would automatically expire after a specified duration.
- 05
Design a Notification System (LLD)
System Design · Hard
I needed to design a Notification System at a Low-Level Design (LLD) level. The focus was on defining the classes, their relationships, and incorporating appropriate design patterns to build a robust and scalable system.