Goldman Sachs | Associate | Bangalore, India | March, 2021 [Offer]

Result
Offer
Location
gurgaon, india
Experience
3.5 years
Posted
26 May 2021
314 reads

Summary

I successfully navigated through multiple rounds of interviews at Goldman Sachs for an SDE1 role, receiving an offer after a week. The process covered a mix of Data Structures & Algorithms, System Design, and behavioral discussions.

How it went

I have 3.5 years of experience working at a mid-size US-based startup. My interview process for the SDE1 position at Goldman Sachs in Gurgaon, India, consisted of several rounds:

1. Online Assessment (~90mins)

  • This was a HackerRank round.
  • I don't recall the exact questions, but they were LeetCode Easy (string-based) and LeetCode Medium (stack-based).

2. DSA | Phone Interview (1hr)

This round focused on Data Structures and Algorithms.

3. DSA | Virtual F2F (1hr)

Another DSA round, followed by some Java-based questions.

4. DSA | Virtual F2F (1hr)

This round continued with DSA problems and some general work-related questions.

5. DSA + SD | Virtual F2F (1.5hr)

This was a mixed round, covering both Data Structures & Algorithms and System Design.

For the Alien Dictionary problem, I wrote incomplete code due to time constraints, but I was able to explain my approach and cover the edge cases to the interviewer.

6. DSA + SD - Virtual F2F (1hr)

This round again combined DSA and System Design. The interviewer asked for various approaches to solve the problem and we also discussed merging sorted lists online.

7. Hiring Manager - Virtual F2F (30mins)

This final round was non-technical. We discussed my ongoing projects, development lifecycle experiences, and my motivations for wanting to join Goldman Sachs.

I was pleased to receive an offer one week after completing my interviews.

Questions asked (10)

  1. 01

    Unique Paths

    Data Structures & Algorithms · Medium

    A classic dynamic programming problem where you need to find the number of unique paths a robot can take to reach the bottom-right corner of a grid, starting from the top-left corner, only being able to move down or right.

    Open the problem
  2. 02

    Minimum Path Sum

    Data Structures & Algorithms · Medium

    Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. You can only move either down or right at any point in time.

    Open the problem
  3. 03

    House Robber

    Data Structures & Algorithms · Medium

    You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night. Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

    Open the problem
  4. 04

    Group Anagrams

    Data Structures & Algorithms · Medium

    Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

    Open the problem
  5. 05

    Design API Rate Limiter

    System Design

    Design an API rate limiter system. This involves discussing high-level design (HLD) aspects such as choosing appropriate data structures, synchronization mechanisms, and handling distributed environments.

  6. 06

    Design Patterns and Java Code

    Other

    I was asked about the applications of Decorator, Dependency Injection, and other design patterns. The interviewer required me to write sample Java code for each pattern to demonstrate understanding.

  7. 07

    Alien Dictionary

    Data Structures & Algorithms · Hard

    There is a new alien language which uses the English alphabet. However, the order among letters are unknown to you. You are given a list of words from the alien language's dictionary, where the words are sorted lexicographically by the rules of this new language. Deduce the order of the letters in this language.

    Open the problem
  8. 08

    Merge k Sorted Lists

    Data Structures & Algorithms · Hard

    Merge k sorted linked lists into one sorted linked list. I was asked to discuss various approaches to solve this problem, and we also explored a scenario for merging sorted lists online (stream processing).

    Open the problem
  9. 09

    Design Job Scheduler

    System Design

    Design a Job Scheduler using message queues. This involves high-level design (HLD) considerations, including how jobs are queued, processed, and distributed, and how message queues facilitate this process.

  10. 10

    Behavioral Questions (Hiring Manager)

    Behavioral

    The hiring manager round involved discussions about my ongoing projects, development lifecycle experiences, and my motivations for wanting to join Goldman Sachs. This was a non-technical assessment of my fit with the team and company culture.

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!