Goldman Sachs Interview Experience | On Campus - Jul 2021

New update is available. Click here to update.

SDE - Intern

Goldman Sachs

4 rounds | 7 Coding problems

Anonymous

Fresher | Jul 2021

Selected

103 views

0 comments

0 upvotes

Interview preparation journey

Preparation

Duration: 7 months

Topics: Probability Statistics, DSA, OOPS, DP, Graphs, Trees

Tip

Tip 1 : Keep calm and DSA prepared
Tip 2 : Use gfg and leetcode for prep
Tip 3 : Do codeforces for CP

Application process

Where: Campus

Eligibility: No criteria

Resume tip

Tip 1 : Mention Education and Internship details precisely
Tip 2 : Projects and achievements should be well highlighted

Interview rounds

Round

Easy

Online Coding Interview

Duration180 minutes

Interview date18 Jul 2021

Problems2

Beautiful Index

You are given an array ‘A’ of length ‘N’. You say an index ‘i’ is beautiful if the sum of the first ‘i - 1’ elements of the array ‘...

Try solving now

Print Diagonal

You are given a 2D matrix, your task is to return a 2D vector containing all elements of the matrix in a diagonal fashion.

Example:

Try solving now

Round

Easy

Video Call

Duration60 minutes

Interview date28 Jul 2021

Problems2

Level Order Traversal

You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.

For example:

For...

Problem approach

Create an empty queue q and push root in q.
Run While loop until q is not empty.
Initialize temp_node = q.front() and print temp_node->data.
Push temp_node’s children i.e. temp_node -> left then temp_node -> right to q
Pop front node from q.

Try solving now

Right View

You have been given a Binary Tree of integers.

Your task is to print the Right view of it.

The right view of a Binary T...

Problem approach

Perform level order traversal on the tree
At every level print the last node of that level

Try solving now

Round

Medium

Video Call

Duration60 minutes

Interview date28 Jul 2021

Problems2

Puzzle Question

You have 5 jars of pills. Each pill weighs 10 grams, except for contaminated pills contained in one jar, where each pill weighs 9 grams. Given a scale, how could you tell which jar had the contaminated pills in just one measurement?

Problem approach

Step 1 : Take out 1 pill from jar 1, 2 pills from jar 2, 3 pills from jar 3, 4 pills from jar 4 and 5 pills from jar 5.
Step 2 : Put all these 15 pills on the scale. The correct weight is 150 (15*10). But one of the jars has contaminated pills. So the weight will definitely be less than 150.
Step 3 : If the weight is 149 then jar 1 has contaminated pills because there is only one contamin...

Check Bipartite Graph

Given a graph, check whether the graph is bipartite or not. Your function should return true if the given graph's vertices can be di...

Problem approach

To be able to split the node set {0, 1, 2, ..., (n-1)} into sets A and B, we will try to color nodes in set A with color A (i.e., value 1) and nodes in set B with color B (i.e., value -1), respectively.

If so, the graph is bipartite if and only if the two ends of each edge must have opposite colors. Therefore, we could just start with standard BFS to traverse the entire graph and

...

Try solving now

Round

Easy

HR Round

Duration30 minutes

Interview date28 Jul 2021

Problems1

Basic HR Questions

Tell me about yourself.

Most difficult situation faced and how did you handle it ?