I applied online. I interviewed at Goldman Sachs (Dallas, TX) in Mar 2024
Interview
Interview Process:
HackerRank (Online Assessment)
Behavioral Round
Loop Round (Technical)
HackerRank:
The online assessment consisted of coding questions focused on data structures and problem-solving. The difficulty level was moderate and manageable if you are comfortable with common algorithmic patterns.
Behavioral Round:
This round focused on teamwork, ownership, and handling challenging situations. The questions were straightforward and conversational. It’s important to clearly explain your thought process and provide structured examples.
Loop Round:
The final loop round was significantly more challenging. It involved deeper technical discussions and problem-solving under pressure. The interviewers tested not just the final answer but how I approached the problem, optimized the solution, and handled hints. This round was intense and required strong fundamentals and clear communication.
Interview questions [1]
Question 1
In the loop round, they asked a challenging data structures problem that required optimizing from a brute-force approach to an efficient solution. The focus was not just on getting the correct answer but on explaining the thought process, handling edge cases, and improving time complexity step by step. They also asked follow-up questions to test deeper understanding of the logic and trade-offs.
Comfortable environment, very chill, make me feel comfortable and were agreeing with my answers, overall very positive experience, and was mostly based on the candidates resume! I did not get a offer even though it did go well, could be the companies budget, or not looking for an entry role.
I applied online. I interviewed at Goldman Sachs (London, England)
Interview
Completed a coding test which was some leetcode style problems. Then was asked for a superday which was just two online interviews. One interview covered a coding problem, another was asking about a high-level approach to a problem
Interview questions [1]
Question 1
How to find if a linked list has a loop with O(1) space complexity.
not much to sau, I just completed the Online Assessment (OA) round. It was the usual blend of coding challenges. did not proceed further so not much else to say
