Glassdoor users rated their interview experience at Goldman Sachs as 75% positive with a difficulty rating score of 3 out of 5 (where 5 is the highest level of difficulty). Candidates interviewing for Operations Analyst and Intern rated their interviews as the hardest, whereas interviews for Analyst and Intern roles were rated as the easiest.
I interviewed at Goldman Sachs (Londres, Inglaterra)
Interview
Very straightforward with prompt feedback loops and quick decision. Clear communication and moved with positive intent. Could not speak more highly of the firm and process. Model for other firms to follow.
I applied online. I interviewed at Goldman Sachs (Bengaluru)
Interview
• Aptitude Test
- The test included 70 questions across verbal, logical, numerical, and diagrammatic reasoning.
- I attempted 66 out of the 70 questions.
• Shortlist and Coursework
- After the aptitude test, I received an email confirming that I was shortlisted for the coding assessment.
- Along with the mail, coursework notes were shared on Data Structures, Algorithms, and CS fundamentals. I used these to revise key concepts before the next stage.
• Coding Assessment
- The coding round included 14 questions, of which 10 were CS based problems, 1 was a situation based problem, and 3 were DSA based:
- Problems were based on string processing, recursive pattern generation and graph traversal.
- I solved all the questions and passed all the test cases.
• Interview Rounds
- After the coding round, I received a confirmation email stating that I was shortlisted for the next phase:
Round 1 – Virtual
- The round began with a brief introduction, followed by a project discussion and two DSA based problems.
Problem 1: Binary Search problem
Problem 2: A matrix-based implementation problem with multiple edge cases
- I solved both problems and passed all the test cases provided by the interviewer and discussed the time complexity of the overall solution.
Round 2 – Virtual
- This round also began with an introduction
- A situational prompt was given which mapped to a connected components problem.
- The problem was then modified to require a Disjoint Set Union (DSU) approach, for which I explained the logic, wrote pseudocode, and discussed the time complexity of the functions and the overall solution.
Interview questions [1]
Question 1
You are given a graph. Answer the following question:
1) Number of components.
2) For each query, you will be given two nodes. Determine if both nodes lie in the same component or not.
The first step of the process is through an online interview. You interview with a AI bot and you have one redo for each question. During this first part, you are asked behavioral questions.