1p3a Question · Sep 2025

Goldman Sachs Data Engineer Associate Interview Experience (2024)

SWE Medium

Question Details

Candidate Profile & Role * Experience: 3 Years * Source: Recruiter outreach * Role: Data Engineer (Hadoop/Spark) Round 1: HackerRank Assessment * Problem 1: Stack-based algorit

Full Details

Candidate Profile & Role * Experience: 3 Years * Source: Recruiter outreach * Role: Data Engineer (Hadoop/Spark) Round 1: HackerRank Assessment * Problem 1: Stack-based algorithm (Medium difficulty). * Problem 2: Sliding Window algorithm (Medium difficulty). Round 2: CoderPad Technical Screen * Problem 1: Given a forest defined by a list of Child-to-Parent relations, determine the number of unconnected trees and identify the root of the tree containing the maximum number of children. * Solution Approach: Depth First Search (DFS). * Problem 2: Grid traversal or manipulation challenge. * Solution Approach: Dynamic Programming (DP). Super Day: Technical Round 1 * Problem 1: Given a sorted array of numbers and a value k, maximize the count of identical elements allowed by incrementing array numbers using a total budget of k. * Solution Approach: Sliding Window. * Problem 2: CPU task scheduler. Given an array of tasks where identical tasks require a cooling period of k cycles, calculate the minimum CPU cycles needed to finish all tasks. * Solution Approach: Heap and Queue. Super Day: Technical Round 2 (System Design & Behavioral) * Behavioral: Discussion regarding resume and current projects. * Coding: Implementation of a Time-To-Live (TTL) based Cache. * Low-Level Design (LLD): Design a Notification System. * Focus: Class structure, entity relationships, and design patterns. Outcome Rejected following Super Day Round 2.

Free preview. Unlock all questions →

Topics

Arrays Trees Graphs Dynamic Programming Heap Stack Queue Two Pointers System Design Oop