Goldman Sachs Interview Experience for Internship (Off-Campus) 2024

After Successfully clearing the Aptitude and Technical round test, My interview was scheduled to be on 11th December 2023.

On the 11th of December 2023, my eagerly anticipated Goldman Sachs internship interview took place, scheduled between 12:15 PM to 8 PM. Despite some delays, my virtual entry into the Zoom meeting marked the beginning of an intense day, starting with an unexpected wait in a breakout room shared by nearly 40 students. Finally, at around 2:30 PM, my turn for the interview arrived.

Interview Round 1:

My interviewer, in a hurry due to the plethora of interviews, emphasized the need for a swift session. After a brief introduction, we delved into the coding segment using Coderpad for real-time code interaction.
The first question involved finding the greatest smaller number than k in a binary search tree. Initially, I presented a brute force approach involving sorting all numbers through an in-order traversal. Subsequently, I suggested a more efficient approach by traversing the tree until the greatest smaller value of k was obtained. You can find a similar solution on GeeksforGeeks [here]
The second question focused on determining the Total minimum delete operations required to make two given strings identical. Initially stumped, I contemplated character frequency through map analysis. However, after a discussion, I shifted to a 2-D dynamic programming approach, equating it to finding the Longest Common Subsequence. Satisfied with the explanation, the interviewer skipped the coding portion. The problem can be explored on LeetCode.

Interview Round 2:

After enduring another significant wait, the second round commenced at 5:30 PM. Following the customary introduction, the conversation delved into my SQL knowledge based on the projects listed on my resume. Admitting my limited depth in these technologies, we promptly shifted focus to problem-solving.

1. Identifying a Loop in a Linked List
   The first question involved detecting a loop in a linked list. I presented two approaches: a brute force method, marking visited nodes, and an optimized approach using slow and fast pointers. The latter, as described in GeeksforGeeks [here], was well-received. She was satisfied with the approach and didn’t ask me to code.
2. Minimum Cost to Cut a Board into Squares
   The second question revolved around determining the minimum cost to cut a board into squares, given the price array of both vertical and horizontal cuts. My approach involved sorting cuts in descending order to prioritize higher-cost cuts. The solution and code can be found on GeeksforGeeks [here]. The interviewer expressed satisfaction with the approach and my code, and the round concluded with a discussion on work-life balance.

Interview Round 3:I

My turn for the third round arrived at 8:45 PM, seemingly at the edge of exclusion. The senior interviewer acknowledged the delays and engaged in a conversation appreciating my patience. After discussing my projects, the conversation shifted to hash maps, and what kind of data structures hashmaps use. I explained the linked list data structure used in hasmaps, how it handles collisions and manages to store them efficiently, and the differences between unordered hasmaps and ordered hashmaps.
DSA Question: Finding Pair with sum closest to k in an Array
Following the technical discussion, he asked a DSA question: finding a pair in an array whose sum is closest to k. Initially presenting a brute force solution, where I find all the possible pairs and search for the best possible pairs, I later optimized it by sorting the array and implementing a two-pointer approach. The solution and description can be explored on GeeksforGeeks [here]. The interviewer asked me if I had any questions for him, I had no other questions in my mind and concluded with a discussion on work-life balance.

Final Result :

Despite my positive outlook, the result on December 16th delivered the news as “NOT-SELECTED”. Reflecting on the experience, I’ve come to realize that success isn’t guaranteed, no matter how well-prepared you are. The key lies in perseverance, consistency, and discipline. Every experience, successful or not, is a stepping stone towards growth.