Goldman Sachs | Associate - Goldman Sachs

Summary

I interviewed for an Associate role at Goldman Sachs in Bengaluru, comprising multiple coding rounds and a technical discussion on Java Concurrency and JVM. Despite solving most coding problems, I received a rejection.

Full Experience

Round 1 : 2 hour Hackerrank test with 2 Easy-Medium questions. I was able to successfully solve both questions within 20-25 minutes.

Round 2 : Coderpad round Q1. https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/ Q2. Similar to https://leetcode.com/problems/trapping-rain-water/description/

Superday Round 3 : Q1. https://leetcode.com/problems/single-element-in-a-sorted-array/description/ Q2. https://leetcode.com/problems/combination-sum-ii/description/

Fumbled badly in the first question.

Round 4 : Q1. https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/description/ Q2. https://leetcode.com/problems/word-ladder/description/

5-6 questions related to Java Concurrency (Runnable, Callable, ExecuterService, Thread Lifecycle) and JVM Garbage Collection.

Got a Rejection Mail after this round.

Edit : Updated the title to clarify YOE :D.

Interview Questions (7)

Find Minimum in Rotated Sorted Array

Data Structures & AlgorithmsMedium

Given a sorted array that has been rotated at some pivot unknown to you beforehand, find the minimum element.

Trapping Rain Water (Similar)

Data Structures & AlgorithmsHard

A problem similar to trapping rain water, likely involving computing how much water can be trapped between elevation map bars.

Single Element in a Sorted Array

Data Structures & AlgorithmsMedium

You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Find this single element.

Combination Sum II

Data Structures & AlgorithmsMedium

Given a collection of candidate numbers and a target number, find all unique combinations in candidates where the candidate numbers sum to target. Each number in candidates may only be used once.

Number of Substrings Containing All Three Characters

Data Structures & AlgorithmsMedium

Given a string s consisting only of characters 'a', 'b' and 'c'. Return the number of substrings that contain at least one occurrence of all these characters 'a', 'b' and 'c'.

Word Ladder

Data Structures & AlgorithmsHard

Given two words, beginWord and endWord, and a dictionary wordList, return the number of words in the shortest transformation sequence from beginWord to endWord.

Java Concurrency & JVM Garbage Collection

Other

5-6 questions related to Java Concurrency (Runnable, Callable, ExecuterService, Thread Lifecycle) and JVM Garbage Collection.

Help the Community

Goldman Sachs | Associate | 3 YOE | Bengaluru | Reject

Summary

Full Experience

Interview Questions (7)

Join the Discussion

No comments yet