goldman sachs logo
Goldman Sachs· compliance analyst

Interview Experience - Goldman Sachs - Analyst - 2yrs

Result
Ongoing
Experience
2 years
Posted
30 Aug 2025
333 reads

Summary

I underwent a multi-stage interview process at Goldman Sachs for an Analyst role, including an Online Assessment, Coderpad rounds, a comprehensive Superday, and a Hiring Manager interview. I am currently awaiting the final decision for the Compliance Analyst position.

How it went

I applied for the Analyst role at Goldman Sachs through a referral and received an Online Assessment link within a few days.

Round 1 - Online Assessment

This round consisted of two coding questions:

  • One question involved using a stack to remove substrings where a character appeared K or more times consecutively.
  • The second was a queue-based problem where I had to simulate a given problem statement.

Round 2 - Coderpad

This round also had two coding questions:

  • A standard Grid Dynamic Programming problem.
  • The classic problem of merging N sorted arrays into a single sorted array.

Superday

My Superday comprised three intense rounds conducted on the same day.

Round 3 - Data Structures

This round focused on data structures and algorithms:

  • I was given a sorted integer array and an integer 'k'. The task was to maximize the frequency of any number by distributing 'k' among elements (incrementing them) until 'k' was non-negative. For example, with [1,3,5,8,10,11,12] and k = 3, the answer is 3 (incrementing 11 by 1 and 10 by 2 results in three 12s). I discussed brute force, binary search, and sliding window solutions.
  • The second question was a standard Dynamic Programming problem on stocks.

Round 4 - Software Engineering Practices

This round delved into software engineering concepts and problem-solving:

  • A problem revolved around finding shortest paths on exchanges, specifically involving negative costs. I explained the limitations of Dijkstra's algorithm and then detailed Bellman-Ford and Floyd-Warshall algorithms.
  • Another problem was a standard sliding window question, which was exactly "Fruit Into Baskets" from LeetCode.

Round 5 - Software Design and Architecture

This was a system design focused round:

  • We started with an in-depth discussion about my current projects and Kafka.
  • Following that, I was given a problem statement similar to "Design Twitter". I thoroughly explained the Functional Requirements (FR), Non-Functional Requirements (NFR), APIs, Entities, and High-Level Design (HLD). My HLD included components such as Load Balancers, Microservices, Caching, CDNs, Asynchronous Processing, S3, DynamoDB, and various Fan-out services. It was a very engaging and insightful discussion, and I learned a lot.

An hour after the Superday, I received a call from HR, informing me that I needed to attend a Hiring Manager round at their office.

Round 6 - Hiring Manager Round

This round primarily focused on behavioral questions, exploring my past experiences and how I handle various situations.

I am now waiting for the final result for the Compliance Analyst role.

Questions asked (6)

  1. 01

    Remove Substrings with K or More Repeating Characters

    Data Structures & Algorithms

    I faced a question involving a stack where I needed to remove substrings if a particular character appeared more than or equal to 'k' times consecutively.

  2. 02

    Merge N Sorted Arrays

    Data Structures & Algorithms

    I was asked to merge N given sorted arrays into a single sorted array.

  3. 03

    Maximize Frequency of Number with K Operations

    Data Structures & Algorithms

    Given a sorted integer array and an integer 'k', in each operation, I could take some portion from 'k' and add it to any number in the array. This could be done until 'k' was non-negative. The goal was to maximize the frequency of any number using optimal operations. For example, if the array is [1,3,5,8,10,11,12] and k = 3, the answer is 3 because I can increment 11 by 1 and 10 by 2, making three occurrences of 12.

  4. 04

    Shortest Path with Negative Costs (Bellman-Ford/Floyd-Warshall)

    Data Structures & Algorithms

    I was presented with a problem involving finding shortest paths on exchanges, which also included negative costs. I discussed the limitations of Dijkstra's algorithm and then explained Bellman-Ford and Floyd-Warshall algorithms as suitable solutions.

  5. 05

    Fruit Into Baskets

    Data Structures & Algorithms

    I was given a standard sliding window problem, specifically related to collecting fruits into baskets.

    Open the problem
  6. 06

    Design Twitter

    System Design

    The round started with discussions about my current project and Kafka. Following that, I was given a problem statement similar to 'Design Twitter'. I explained the Functional Requirements (FR), Non-Functional Requirements (NFR), APIs, Entities, and High-Level Design (HLD) covering components like Load Balancers, Microservices, Caching, CDNs, Asynchronous Processing, S3, DynamoDB, and Fan-out services.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Goldman Sachs recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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