SDE - Intern
Goldman Sachs
4 rounds | 7 Coding problems
103 views
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
01
Round
Easy
Online Coding Interview
Duration180 minutes
Interview date18 Jul 2021
Problems2
Beautiful Index

view more
Print Diagonal

#### Example:

view more
02
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...``
view more
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.

Right View

#### The right view of a Binary T...

view more
Problem approach

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

03
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...

view more
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...

view more
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

...

view more
04
Round
Easy
HR Round
Duration30 minutes
Interview date28 Jul 2021
Problems1
Basic HR Questions

Most difficult situation faced and how did you handle it ?

Start a Discussion
Similar interview experiences
Software Analyst
4 rounds | 8 problems
Interviewed by Goldman Sachs
6372 views
SDE - Intern
3 rounds | 7 problems
Interviewed by Goldman Sachs
1866 views
SDE - Intern
3 rounds | 11 problems
Interviewed by Goldman Sachs
3834 views
Software Engineer Intern
3 rounds | 6 problems
Interviewed by Goldman Sachs
28 views
Companies with similar interview experiencs
SDE - Intern
2 rounds | 3 problems
Interviewed by Trilogy Innovations
16756 views