Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Goldman Sachs interview experience Real time questions & tips from candidates to crack your interview

Goldman Sachs

4 rounds | 10 Coding
problems

Preparation

Duration: 5 months

Topics: I covered major data structure topics like Arrays, Stacks, Queues, Linked List, Trees, Graphs, backtracking, Dynamic Programming. After reading each topic, I tried to practice maximum questions on the concerned topic from Coding Ninjas and when stuck on a question, I preferred watching solution videos provided by Coding Ninjas.

Tip

Tip 1 : It is important to practice coding consistently because it is what enables you to solve interview-questions in the stipulated time. But before this, it is even important to have a clear understanding of all the data-structures, so that they can be easily implemented as and when required to solve a problem.

Tip 2 : They do not judge you upon the number of internships you have done or the number of projects you have made. A single,good-quality project is sufficient, provided you have in-depth knowledge about it.

Tip 3 : Practise topic-wise questions, participate in lots of coding contests, watch lots of Youtube solutions even after you could solve a question, because you may find a different approach that is efficient than yours,

Application process

Where: Campus

Eligibility: 7 CGPA

Resume tip

Tip 1 : Keep your resume short and clear. Mention your projects and internships with a brief description and year of completion.

Tip 2 : Be very honest and figure out only those things in your resume that you really know.

01

Round

Easy

Face to Face

Duration90 minutes

Interview date23 Jun 2019

Coding problem3

This was face to face interview round. The interviewer was very friendly. He started by asking tell me

something about yourself. I told him about my interest in competitive coding(since I am weak in

probability, I always mentioned competitive coding in my introduction so that the interviewer

asks me coding questions and didn’t move to the probability section).

```
It is guaranteed that there exists at least one pair of points in the given array/list that satisfies the constraint |'xi - xj'| <= 'K'.
```

```
1. The structure of the city is already defined. You should not change it.
2. The address of the house at the 0’th level is already given.
3. There is at least one house in the city.
4. You may only use constant extra space.
```

02

Round

Medium

Face to Face

Duration40 minutes

Interview date13 Jun 2019

Coding problem3

The interviewer was very friendly to me. She was praising me for every solution that I provided.

```
Suppose given ‘AREA’ is ‘6’. So, possible combinations are [ [ 1, 6 ], [ 2, 3 ], [ 3, 2 ], [ 6, 1 ] ]. We can’t choose [ 1, 6 ], [ 2, 3 ] as in this case breadth is greater than length.
So, we choose [ 3, 2 ] over [ 6, 1 ] as the difference between | 3 - 2 | < | 6 - 1 | so we return | 3, 2 | as the answer.
```

```
You are not required to print anything explicitly. It has already been taken care of. Just implement the function.
```

```
1. Buying a stock and then selling it is called one transaction.
2. You are not allowed to do multiple transactions at the same time. This means you have to sell the stock before buying it again.
```

```
Input: ‘n’ = 7, ‘prices’ = [3, 3, 5, 0, 3, 1, 4].
Output: 6
Explanation:
The maximum profit can be earned by:
Transaction 1: Buying the stock on day 4 (price 0) and then selling it on day 5 (price 3).
Transaction 2: Buying the stock on day 6 (price 1) and then selling it on day 6 (price 4).
Total profit earned will be (3 - 0) + ( 4 - 1) = 6.
```

03

Round

Easy

Face to Face

Duration50 minutes

Interview date13 Jun 2019

Coding problem2

This round was about System Design, Data Structures and Algorithms

Design a job scheduler. Tasks will be given as inputs with an extra parameter ‘delay’.That meaning the task has to run after this ‘delay’ time.

```
Can you solve each query in O(logN) ?
```

04

Round

Medium

Face to Face

Duration30 minutes

Interview date13 Jun 2019

Coding problem2

THIS WAS A PUZZLE BASED ROUND

Given a point on the perimeter of the circle and an interior point. Find the probability that the rectangle formed with diagonal as the line segment joining these points lies inside the circle.

Problem approach

Tip 1 : Practise from gfg

My wife and I recently attended a party at which there were four other married couples. Various handshakes took place. No one shook hands with oneself, nor with one's spouse, and no one shook hands with the same person more than once. After all the handshakes were over, I asked each person, including my wife, how many hands he (or she) had shaken. To my surprise, each gave a different answer. How many hands did my wife shake?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?

Choose another skill to practice

Start a Discussion

Similar interview experiences

SDE - Intern

3 rounds | 5 problems

Interviewed by Goldman Sachs

2079 views

0 comments

0 upvotes

SDE - Intern

3 rounds | 11 problems

Interviewed by Goldman Sachs

5474 views

0 comments

0 upvotes

SDE - Intern

2 rounds | 4 problems

Interviewed by Goldman Sachs

715 views

1 comments

0 upvotes

SDE - Intern

4 rounds | 7 problems

Interviewed by Goldman Sachs

543 views

0 comments

0 upvotes

Companies with similar interview experiences

SDE - Intern

3 rounds | 6 problems

Interviewed by Amazon

13501 views

4 comments

0 upvotes

SDE - Intern

4 rounds | 7 problems

Interviewed by Microsoft

12619 views

1 comments

0 upvotes

SDE - Intern

2 rounds | 4 problems

Interviewed by Amazon

8992 views

2 comments

0 upvotes