Goldman Sachs On Campus | Internship Interview Experience | Selected

goldman sachs logo
goldman sachs
InternshipOn CampusOffer
March 2, 202319 reads

Summary

I was selected for the Goldman Sachs internship after a multi-round on-campus interview process. The interviews focused heavily on problem-solving, data structures, and OOPs concepts.

Full Experience

My interview journey for the Goldman Sachs internship began with an on-campus coding test, which was followed by a series of interview rounds. The coding test comprised five sections: Coding, CS MCQ, Problem Solving MCQ, Advanced Problem solving, and Subjective. I had to be careful with MCQs due to negative marking, but the coding questions were manageable.

Interview Round 1:
In the first interview, I was given a single algorithmic problem. I was asked to find the number of paths from the top-left to the bottom-right cell in an m*n matrix such that the sum of elements along the path equals a given number k. I successfully coded my solution and demonstrated its functionality.

Interview Round 2:
The second round focused on another problem-solving question involving binary trees. I needed to determine if the value of a node was equal to the sum of all nodes in its subtree rooted at it. After coding my initial solution, I was prompted to further optimize it. This round also included general OOPs and HR questions.

Interview Round 3:
The final round began with a deep dive into my resume and projects. I explained one of my projects, which led to a discussion about its data storage structure and potential optimization strategies. Following this, I was given a relatively straightforward tree problem: to output all nodes visible from the right side of a binary tree. The last question was a modified binary search problem, but I cannot recall the specifics of the modification.

Overall, the on-campus process was very smooth, and the interviewers were exceptionally friendly and helpful. I gathered that Goldman Sachs places significant emphasis on problem-solving abilities. While direct core CS questions weren't asked, concepts related to relational and non-relational databases, as well as OOPs, were touched upon indirectly.

Interview Questions (4)

Q1
Paths in Matrix with Target Sum K
Data Structures & Algorithms

Given an m*n matrix and a number k, find the number of paths from the top-left cell to the bottom-right cell such that the sum of all elements in the path equals k. I was also asked to code my solution and run it.

Q2
Node Value Equals Subtree Sum
Data Structures & Algorithms

Given a binary tree, check if the value of a node equals the sum of all nodes in the subtree rooted at it. I was asked to code my solution and improve it further.

Q3
Project Data Storage Optimization
System Design

After explaining one of my projects, I was asked about the structure of its data storage and how it could be optimized further.

Q4
Binary Tree Right Side View
Data Structures & Algorithms

Given a binary tree, output all the elements/nodes visible from the right view of the tree.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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