Goldman Sachs | Internship | Offer 2023
- Result
- Offer
- Posted
- 21 Jul 2022
Summary
I successfully navigated the interview process for a Summer Analyst internship at Goldman Sachs in 2023, ultimately receiving an offer. The process included a challenging coding round followed by three technical interviews focusing on data structures, algorithms, object-oriented programming, and database management systems.
How it went
Coding Round
As a pre-final year student, I participated in Goldman Sachs' on-campus recruitment drive for Summer Analyst interns in 2023, which was open to all branches without a CGPA criterion. The first round was a 1 hour 50 minute coding assessment comprising four sections:
- Two medium-level coding questions.
- MCQs covering math and aptitude.
- Coding-related MCQs.
- Two essay-type questions.
Around 40 students, including myself, were shortlisted for interviews.
Interview 1
This interview was conducted via Zoom with a shared code pair link. After my introduction, the interviewer asked me to solve the Next Smaller Palindrome problem. Following that, we discussed the differences between file systems and DBMS.
Interview 2
In the second interview, I began by giving a brief description of my projects and the tech stacks I had utilized. Then, I was presented with a coding challenge: the Missing Number problem. The interviewer then gave me a second question, First Missing Positive, specifically asking for a solution in linear time and constant space.
Interview 3
The third interview was also highly technical. It started with a discussion about my projects. I was then asked to list all the data structures I knew, followed by questions on different ways to represent a graph and the advantages of using an adjacency list. I was then given a question on BST, specifically the Minimum Absolute Difference in BST problem from LeetCode. Additionally, I was asked to implement a Sudoku validation function, with the constraint that checking a particular index should be done in a single iteration rather than using multiple nested loops. The interview concluded with some questions on OOP and DBMS, including basic SQL queries.
Questions asked (5)
- 01
Next Smaller Palindrome
Data Structures & Algorithms
Given a numerical input, find the next smallest palindromic number. For example, if the input is 1234, the output should be 1221.
- 02
Missing Number
Data Structures & Algorithms · Easy
Given an array
numscontainingndistinct numbers taken from0, 1, 2, ..., n, find the single number that is missing from the array. - 03
First Missing Positive
Data Structures & Algorithms · Hard
Given an unsorted integer array
nums, find the smallest missing positive integer. The solution was specifically requested to be implemented in linear time and constant extra space. - 04
Minimum Absolute Difference in BST
Data Structures & Algorithms · Easy
Open the problemGiven the root of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two different nodes in the tree.
- 05
Validate Sudoku (Single Iteration)
Data Structures & Algorithms · Medium
Implement a function to validate a Sudoku board. The critical constraint was to ensure that the check for any particular index (row, column, and 3x3 sub-box) could be performed in just one iteration, avoiding the use of multiple nested for loops for validation.