Goldman Sachs visited our campus for campus recruiting for an Internship.
The eligibility criteria for the hiring process was:-
- Minimum cgpa of 7
- All branches
- No standing backlog
They gave a pre placement talk about the company and the role. They also gave insights about the work culture and company environment. After that the eligible candidates were required to submit their resumes and they would be selected via their resumes. We had to wait for a day, after which they sent emails to shortlisted candidates. Luckily I was one of them.
The recruitment process had 2 rounds, one Online Assessment and one Interview round.
Round 1: Online Test
Round 1 was an online assessment round. It was conducted on the Hackerank platform.
There were multiple sections including:-
|Section 1|| Coding|
|Section 2|| MCQ on quants|
|Section 3|| Advanced Coding|
|Section 4|| Subjective Questions|
|Section 5|| MCQ on DSA|
In the MCQ section they had negative markings, deducting 2 marks for each wrong answer. The marks for the right answer was 5 marks. PrepInsta has a Hackerank page, where they explain about Hackerrank and what to expect in a Hackerrank exam. I read through that and it was really helpful.
You can find it here: What is Hackerrank? Additionally I practiced the Hackerrank quizzes and found many questions common in the exam.
In Advanced Coding my question was the Coin Game question, where a problem statement is given about a man who is playing a game of coins, and he has to win the game before his coins run out. We need to find the minimum steps in which he can win the game.
The solution for this question can be found here: Hackerrank Advanced Coding Questions
After the Online Test it took another week for the results to come. And a total of 50 students had cleared the round.
Round 2:-Interview Round
They only conducted one Interview Round. It went on for around an hour and they asked a lot of programming questions. The interviewer was a senior member of the company, and was very kind during the interview.
The interview started with introductions. I gave a short introduction of myself highlighting my coding experience and the coding competitions that I had participated in. He asked me questions on these competitions and was very impressed by them.
Some of the questions that he asked me were:-
1.In the chat box he gave me an unsorted array and a float value. The question was to find where the float value fits in the array. I wrote the code and he asked me to explain my approach.
2.What is a Binary Search Tree?
A binary search tree can be defined as a data structure that fulfills the following properties:-
- The left sub tree must contain all the nodes containing the values than the root node
- The right sub tree must contain all the nodes containing the values more than the root node.
- Each of the left and the right sub tree must be a binary tree itself.
3.What are sorting algorithms? Give the code for any sorting algorithm.
A sorting algorithm rearranges a given data (List or array) into an order.