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

SDE - Intern

Goldman Sachs
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 4 months
Topics: Recursion , pointers, backtracking,oops, aptitude, reasoning
Tip
Tip

Tip 1 : start from scratch
Tip 2 : practice as much as u can
 

Application process
Where: Other
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : some students add fake internships to their resume dont do it.
Tip 2 : Don't Put Everything on There. Your resume should not have every work experience you've ever had listed on it.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date20 Feb 2021
Coding problem2

It was on done in hackerrank

1. Find rank

Easy
15m average time
85% success
0/40
Asked in companies
Goldman SachsAtlassianMicrosoft

You are given a matrix ‘ARR’ having dimensions ‘N*M’. Your task to find the rank of the matrix ‘ARR’.

The rank of a matrix is defined as:

(a) The maximum number of linearly independent column vectors in the matrix.
OR
(b) The maximum number of linearly independent row vectors in the matrix.
Both definitions are equivalent.

Linear independence is defined as:

In the theory of vector spaces, a set of vectors is said to be linearly dependent if there is a nontrivial linear combination of the vectors that equals the zero vector. If no such linear combination exists, then the vectors are said to be linearly independent. 
Try solving now

2. Number Of Triangles In An Undirected Graph

Moderate
10m average time
90% success
0/80
Asked in companies
IBMAccentureGoldman Sachs

Given an undirected graph, find how many triangles it can have where a triangle is a cyclic path of length three which begins and end at the same vertex.

#### An undirected graph is a graph in which if you can go from a vertex, say, ‘A’ to ‘B,’ you can come back to ‘A’ from ‘B.’

For example:

In this graph, we can visit from vertex 1 to 2, then we can also visit from vertex 2 to 1. This is true for all vertices.
Try solving now
02
Round
Medium
Video Call
Duration20 minutes
Interview date20 Feb 2021
Coding problem1

Interviewer was quite friendly

1. Technical Questions

Why we use linked list ?
Dynamic allocation?
Recursion?

Here's your problem of the day

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

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by Goldman Sachs
2171 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 11 problems
Interviewed by Goldman Sachs
5556 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Goldman Sachs
779 views
1 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Goldman Sachs
595 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
13918 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
13230 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
9230 views
2 comments
0 upvotes