Goldman Sachs Internship Interview Experience

Round 1 (Online) :

This was an online test on HackerRank. There were a total of 5 sections in this test. 3 coding questions (2 basic and 1 advanced ), MCQs, aptitude, quant, probability and two subjective questions ( HR type ) . If you did well in any one (either coding or quant) you will be qualified for the next round. A totals of 24 candidates were selected for the next set of rounds .

Round 2 (Technical Round):



After the presentation, a technical round was held for all the 24 selected candidates . The interviewer asked to introduce myself and then proceeded to ask some coding questions . He asked me the various approaches for finding nth term in a fibonacci sequence . I told him the 3 approaches I knew with the time complexities . He then asked me to write the DP approach . He then asked me my strong point in all the subjects I had studied in my academics. I responded with DSA . Then he proceeded with asking the implementation of Djikstra’s algorithm and its complexity and why an adjacency list is preferred over an adjacency matrix . Besides he gave me a problem of finding whether a station is reachable from another in minimum time complexity . I told him that we could use DSU data structure. Then he asked me to implement and show its working . He asked me what I had done in my previous intern and about the various projects I had listed in my CV . He concluded the round by asking if I had any questions .

Round 3 (Technical Round):

A total of 12 candidates were selected for the second technical round . The interviewer again asked to introduce myself . He talked about my intern and projects I had listed . Then he proceeded with asking some coding questions . The first question he asked was whether a string is beautiful or not . A string is beautiful if the entire string is a sequence of contiguous numbers . I gave him an O(n^2) solution and he seemed satisfied . He asked me to implement the solution and for any possible edge cases . Secondly, he asked to find an array given that the sum of every pair of elements is given. e.g if the original array has 4 elements, the array given to us is a0+a1, a0+a2, a0+a3, a1+a2, a1+a3, a2+a3 in this order and we have to find the original array . He asked me to implement the solution . Lastly, he asked me to find the square root of any number correct to 6 decimal places without using the square root function . I gave him a binary search solution and he seemed satisfied .He concluded the round by asking if I had any questions .

Round 4 (HR + Technical Round):

A total of 5 students were selected for this round . Again I was asked to introduce myself. The interviewer looked at my previous performances and CV and asked me why I had chosen to do a particular skill . He asked me about the experiences i had gained in the hackathons I had been to and asked whether I preferred to work individually or in a team . He then asked me a recent real life problem that I had solved or thought about . I told him a problem and a potential solution to that problem . He asked for the system design of that solution and even helped me in that . He then asked me why do i want to join GS and what are my expectations from GS . He concluded the round with a handshake and asked me to wait for the results while wishing me good luck .

 

So after a gruelling day, the results were declared and a total of 3 students were selected and I was lucky to be one of them. A big thanks to the various interview experiences on gfg which helped me prepare.

 

Tips: Be calm and composed . The interviewer will always help you if you’re going in the wrong direction . Listen to the question carefully and if you don’t understand the question, ask him to repeat it and explain by giving some test cases . Good luck !

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



My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

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.