Skip to content
Related Articles

Related Articles

Goldman Sachs Interview Experience | Set 9 (On-Campus for Internship)
  • Difficulty Level : Medium
  • Last Updated : 28 May, 2019

Goldman Sachs Interview Experience (On-Campus for Internship)

  • Online Round (Aptitude+Coding) : (1:30 hrs)

    Students of all branches were allowed to appear in the online round.
    15 MCQs only on aptitude for the first half an hour followed by a coding question to be solved in the next one hour. There was no negative marking in the aptitude section. The aptitude questions were really good given the time limit. The test was conducted on Hacker Rank. Compilers for coding were not allowed.
    The aptitude section carried 60 marks and 40 marks for one coding question.
    A total of 18 students got through the online round.

  • Interview 1(FTF):
    1. Describe a semaphore and explain its working. How would you use a semaphore to solve the producer-consumer problem? A blank sheet was provided to write the pseudo-code.
    2. Given a binary tree, check if the value at the node is less than the sum of the values of its left and right child if so replace the value at the node with the sum. The code was not necessary; he demanded proper logic for solving it.
    3. Given a binary tree, write the code to convert the tree into its mirror image. I wrote the code on a piece of paper and then the interviewer asked some questions about the working of the code. The interviewer seemed to be satisfied with my answers.


  • Interview 2(FTF):
    First of all he asked about my background and then proceeded with the questions.
    1. What is virtual memory ? Describe virtual address space .
    2. Given a square board of n rows and n columns, find the total no of squares in it. (There is a formula to it which can be arrived at by observation).
    3. Find the total number of triangles in a hexagon with edges connecting each vertex to another.
    4. Write code for reversing a linked list.
      Hint: Both iterative and recursive techniques can be followed .

    5. Find all values of n for which n&(n-1)==1 and n&(n-1)==0.

At the end he asked what are my subjects of interest and if I have any questions to ask.

A total of 9 students were selected for the internship at the end.

All thanks to geeksforgeeks for helping me with my preparation.

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.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.   In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :