Goldman Sachs CoderPad Interview | August 2025 | Engineering Associate | USA
- Location
- USA
- Posted
- 7 Aug 2025
Summary
I recently appeared for my CoderPad interview round for an Associate position at Goldman Sachs. The interview focused on DSA, where I was asked two very easy questions, including an easier variation of the 'High Five' problem, which I solved successfully. I am currently awaiting the results of the interview.
How it went
I recently appeared for my CoderPad interview round for an Associate position at Goldman Sachs. The interviewer was on-time. It started with an overview of what to expect during this round, followed by quick introductions.
The interview was focus on DSA. I had opted for Python as my language prior to the interview. The interviewer also mentioned that I'm allowed to use Google (no AI tools like ChatGPT) for looking up syntax, but not the whole code itself. I was asked two very easy questions which I was able to complete in about 30 minutes. The interviewer was helpful and provided hints as well.
First question: It was a very easy Array question which could be solved using Two-Pointers technique. I presented brute, better and optimal approaches, and we implemented the optimal approach (TC: O(N), SC: O(1)) after discussing the trade-off's.
Second question: A much easier variation of the "High Five" question that required just a Hash Map (no min/max heaps). This problem has only a single solution (TC: O(N) + O(M) where N is the size of the list and M is the size of the HashMap, SC: O(M))
The interviewer was satisfied with the approach and we tested all the edge cases for both the problems. The interview concluded with the questions for the interviewer.
TBH, I was pretty nervous before the interview since it has been a minute since I appeared for one. But when the questions were rolled, I felt confident. I prepared for the interview using LC-Tagged.
Awaiting result of the interview.
Questions asked (1)
- 01
High Five (Easier Variation with Hash Map)
Data Structures & Algorithms · Easy
A much easier variation of the "High Five" question that required just a Hash Map (no min/max heaps). This problem has only a single solution. I presented an approach with time complexity O(N) + O(M) where N is the size of the list and M is the size of the HashMap, and space complexity O(M).
How they prepared
I prepared for the interview using LC-Tagged.