First Round comprises of 1 coding question of 20 marks and 16 MCQs. MCQs was based on stats, probability, data structure, combinatorics etc. Each MCQ has 10 marks for correct answer and negative 2 for wrong one.
Coding question was:
K numbers was given in an array. We can flip any number of 0s (in binary form) to 1 of each number. Each number is represented in n bits. We have to tell that how many distinct numbers are possible.
Around 43 people were shortlisted from 240 people for further rounds.
We have brief discussion about my resume. Then she asks me three coding questions that I have to write its solution on the paper.
- First question was: https://www.geeksforgeeks.org/reverse-words-in-a-given-string/
- Second question was : https://www.geeksforgeeks.org/detect-loop-in-a-linked-list/
- Third question was: https://www.geeksforgeeks.org/find-maximum-path-sum-in-a-binary-tree/
At last she asks me weather I have any questions. I asked her 2 questions. One was what is her work in Goldman Sachs. Second One was work culture in Goldman Sachs.
Interviewer was very friendly.
This was a mix round containing questions from OS, networking etc.
First one was where bash executable file is located in linux system. Another one was how to find CPU performance.
After that he asks me How server client model? Then some questions on OSI model were asked.
This round has 1 question from probability, 1 from coding (DP), 1 question as a puzzle.
He asks me weather I am confortable with probability or not. I immediately said yes.
- He asks me what is expeced number of tosses of a fair coin, we stops when consectutive head come. https://www.quora.com/What-is-the-expected-number-of-coin-flips-until-you-get-two-heads-in-a-row
- Second one was coding question based on DP. You have stick of size N. You are allowed to cut the stick of size of integral values only. Value of different sizes of stick was given. Maximize the value by cutting stick.
- Third one was celebrity problem. You have to minimize the questions to be asked. https://www.cs.princeton.edu/courses/archive/spring13/cos423/problem0-1.pdf
Initially interviewer asks me weather I knows Lazy propagation or not. I reply it with no.
Then he asks me connecting noodles problem.
Interviewer asks me about some basic sorting and search based question.
- Then he asks me to find element x in an infinitely long array. It was similar to https://www.geeksforgeeks.org/find-position-element-sorted-array-infinite-numbers/ He ask me to prove that why we use power of 2 only. I tried to convince him by giving argument that by using 2 we will have to search lesser number of indices in an array. But he did not get convinced completely.
- Second question was to construct an BST from an sorted array. It was similar to https://www.geeksforgeeks.org/sorted-array-to-balanced-bst/
All the interviewers was very friendly and helps you if you got stuck. Be confident and say no, if you are unconfortable on any topic. I have told them that I am not good in Networking and lazy propagation.
At the end, I got selcted along with 10 other people get selected.
- Goldman Sachs Interview Experience | Set 43
- Goldman Sachs Interview Experience | Set 49
- Goldman Sachs Interview Experience | Set 7
- Goldman Sachs Interview Experience | Set 6
- Goldman Sachs Interview Experience | Set 40
- Goldman Sachs Interview Experience | Set 48
- Goldman Sachs Interview Experience | Set 5
- Goldman Sachs Interview Experience | Set 19
- Goldman Sachs Interview Experience | Set 41
- Goldman Sachs Interview Experience | Set 38
- Goldman Sachs Interview Experience
- Goldman Sachs Interview Experience | Set 51
- Goldman Sachs Interview Experience
- Goldman Sachs Interview Experience | Set 23 (2+ years Experience for Java Developer Role)
- Goldman Sachs Interview Experience | Set 24 (On-Campus )
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.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.