Goldman Sachs Interview Experience (On-Campus)

Round 1:

The first round comprised of 1 coding question and 9 MCQ questions.

Coding question : https://www.geeksforgeeks.org/count-ways-express-number-sum-consecutive-numbers/

MCQs were asked from maths, data structures and algorithms.

15 people were selected in this round.

Round 2 (Technical Round):

  1. Introduce yourself
  2. Questions from projects mentioned in my resume
  3. What is radix sort?
  4. Coding question : https://www.geeksforgeeks.org/validity-of-a-given-tic-tac-toe-board-configuration/

Out of 15 people, 12 were selected for next round.

Round 3 (Technical Round):

  1. Introduce yourself
  2. Questions from my resume
  3. Problems I faced in previous projects
  4. Coding question : Find minimum element in stack in O(1) time and O(n) space. Optimize the solution.

Out of 12 people, 9 were selected for next round.

Round 4 (Technical Round):

  1. Introduce yourself
  2. Coding question : https://www.geeksforgeeks.org/inplace-rotate-square-matrix-by-90-degrees/
  3. Puzzle : 30 cupcakes are given. 1 of these is poisoned. If a rat eats a poisoned cupcake it will die after 10hrs. You have 24 hrs to find out the poisoned cupcake. Find out the minimum number of rats required for this task.
  4. There is an elevator coming down from top floor. It should first stop at the upper floor requested and then the lower floor. For ex.- If a person presses 5th floor button, another person presses 7th and the third one presses 6th. The elevator should first stop at 7th floor, then 6th and then 5th. Which is the best data structure that should be used for this task.   (Answer : Maxheap)

At the end of each round,  I was asked whether I had any questions for them.

Out of 9 people, 4 were selected including me.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.




Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.