Skip to content
Related Articles
Open in App
Not now

Related Articles

Goldman Sachs Interview Experience | Set 15 (On-Campus for Internship)

Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 28 May, 2019
Improve Article
Save Article

Goldman Sachs Visited our campus a week back and this was the procedure.

  • Round 1 : Online Round (90 minutes)
    Platform: HackerRank
    15 MCQ Questions (tough if asked to solve in 30 minutes)
    1 coding question. The question was pnc based.

    17 were selected after this round.

  • Round 2 : PI (Technical) 45 Minutes-1 hour

    Introduce yourself.

    1. Detailed discussion of my projects (make sure you are well versed with your projects)
    2. 1 puzzle on the 2 rope problem which burns in 60 minutes, and you have calculate 45 minutes.
    3. Then asked me my interests, I said Data Structures.
    4. Asked me questions on HashTable, HashMap, implementation of the same.
    5. Find if 2 given nodes of a tree are siblings or not.
    6. Given a linked list and only a pointer to the node delete the node.
    7. Another puzzle question. There are 25 horses with a race track on which 5 horses can race at a time. How many minimum races needed to find top 3 horses.
  • Round 3 (Technical) 45 minutes.
    1. He saw my cv thoroughly and saw I knew php and hence database. So asked me to design a database system for mobile shops in different cities with different branches in each city. Each branch selling same mobile phone at different costs.
      Then asked me to write a query to get the branch and city where the mobiles phone’s cheapest price is available.

    2. Asked me to implement queue using 2 stacks.
    3. Given two array find which number is missing from the first and second one. (easiest question of all)
  • Round 4 (Interview with the hiring manager) 45 minutes
    1. Asked me to introduce myself.
    2. Saw I knew data structures so asked me to implement heap and asked why trees are used if we can represent the tree in an array ( given that if a child is not present we mark that array element as 0)
    3. Asked me how can we implement a search engine like Google with millions of pages to be searched. I answered hash table as it’ll take O(1) time. Then I was asked what would be the time complexity if we’ve clashing in the hash buckets. Asked me about best hash functions.
    4. One aptitude question. Given 8 balls with one having more weight than other find it in minimum tries (Common question) I answered. He said now let’s the change the question to “you don’t know if the odd one out ball is lighter or heavier than others”, now how many tries are needed? (couldn’t solve this one)

I would like to thank Geeksforgeeks for helping me in the preparation for my interviews.

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

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!