'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Goldman Sachs interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Goldman Sachs
upvote
share-icon
3 rounds | 7 Coding problems
Interview preparation journey
expand-icon
Journey
I started doing coding in Java by taking course from coding ninjas in 2nd year. Before this I was exploring different programming like python, c++ , java. So I choose java. After completing the course i started practicing on geeksforgeeks and leetcode. After this in 3rd year I have made mini project. I have also taken inhouse training on ML.
Application story
I have applied through Hackerrank.com. After applying, my resume got shortlisted, and I got a test link. After the test, I got an interview link for the discussion round. After that I got mail.
Why selected/rejected for the role?
I got rejected because I was not able to give a proper optimized approach for coding questions and SQL queries. I got rejected in 3rd round.
Preparation
Duration: 2 months
Topics: Data Structures, CPP, Algorithms, PUZZLES, Operating systems, DBMS.
Tip
Tip

Tip 1 : Revise all the coding interview questions that you have solved so far in the last few days
Tip 2 : Practice writing the codes on paper with clarity
Tip 3 : Mention only those thing that you know in your CV and revise your projects nd everything you have mentioned on your resume thoroughly.

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

Tip 1 : Do not even mention topics you have no idea about
Tip 2 : you should have some projects on resume and you should be able to explain clearly why you have chosen the particular project, what does it do, its functionality, outcomes and everything about each of the projects.
Tip 3 : Tailor your resume according to the needs/the role you are applying for

Interview rounds
01
Round
Medium
Online Coding Interview
Duration120 minutes
Interview date10 Sep 2020
Coding problem3

A 120-minute online test was conducted on HackerRank which had the following format:
1st Section :
2 Coding questions(30 minutes)
2nd Section :
10 MCQ questions(30 minutes)
3rd Section :
1 Advanced Programming Question(45 minutes)
4th Section :
2 Subjective Questions(15 minutes)
The coding questions and MCQ questions were a bit tricky so you need to manage your time properly and try to solve all the questions correctly..
Technical – included c and c++ output question, os(scheduling, semaphore), dbms(normal form, etc).

 

1. The Celebrity Problem
Moderate
30m average time
60% success
0/80
Asked in companies
SamsungCiscoMicrosoft

There are N people in a party, they might or might not know each other names.
There is a celebrity in the group, celebrity does not know anyone and all people know the celebrity.We can only ask questions like “does A know B?”. (Celebrity problem)
What is the worst case time complexity of the optimal solution to find the celebrity?
O(n)
Let’s say we ask “does A know B?”. If A knows B...

View more
Problem approach

Approach: The idea is to use two pointers, one from start and one from the end. Assume the start person is A, and the end person is B. If A knows B, then A must not be the celebrity. Else, B must not be the celebrity. At the end of the loop, only one index will be left as a celebrity. Go through each person again and check whether this is the celebrity.
The Two Pointer approach can be used w...

View more
Try solving now
2. Ways to express ‘n’ as the sum of consecutive numbers
Hard
15m average time
85% success
0/120
Asked in companies
GenpactDeutsche BankVisa

You are given the number ‘N’. The task is to find the number of ways to represent ‘N’ as a sum of two or more consecutive natural numbers.

Example:
View more
Problem approach

Suppose we start our summation series from 1 i.e. 1+2+3+…..
Max no. of numbers whose summation will be less than or equal to N: floor(X)
where X*(X+1)/2=N
So N as a sum of positive consecutive integers will at max consist of X numbers.
Here we can check each possibility k(assume) between 2 and X (both inclusive) and to check we can use the concept of A.P. as the summation series is ...

View more
Try solving now
3. Number of Pairs with Given Sum
Moderate
39m average time
60% success
0/80
Asked in companies
American ExpressIntuitCognizant

You have been given an integer array/list(arr) and a number 'Sum'. Find and return the total number of pairs in the array/list which when added, results equal to the 'Sum'.

Note:
...
View more
Try solving now
02
Round
Medium
Video Call
Duration45 minutes
Interview date12 Nov 2020
Coding problem2

interview started with a typical tell me about yourself question. The interviewer was nice and friendly. 

He asked me to explain a little about my projects (only basics).
Which all data structures you know and my favourite data structure. I replied with a linked list.
He asked the difference between array and linked list, time complexities of insertion, deletion, etc. in both of them. Then he asked about sorting an array, different algorithms, and their time complexities.
How would you sort a linked list? How would you find the middle of the linked list in one pass? How would you merge two linked lists (I had to write code for the same)?
Then he asked how would you be able to manage the business and finance decisions at GS.
Tell me an incident when you had the chance to display your leadership skills.
Lastly, I was allowed to ask questions from the interviewer.

1. Data Structure Question

Explain linked list and operations on linked list. (Learn)

2. Check if two nodes are cousins
Moderate
10m average time
90% success
0/80
Asked in companies
GoogleGoldman SachsPaytm (One97 Communications Limited)

You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a and b, you need to check if these nodes are cousins.

View more
Problem approach

intially a solution that finds whether given nodes are cousins or not by performing three traversals of binary tree has been discussed. next after asking for any different or optimal way to solve the same question by interviewer,
the approach to solve the problem by performing level order traversal is discussed . The idea was to use a queue to perform level order traversal, in which each que...

View more
Try solving now
03
Round
Medium
Video Call
Duration45 minutes
Interview date14 Nov 2020
Coding problem2

This round was relatively short and mostly consisted of coding (on hackerrank’s codepair platform)

The interviewer asked me about my previous interview and what all questions were asked in it.
Then there was a discussion about my projects and the technologies used in them. How would you deploy an application and what happens in the process of entering a keyword in the browser and loading your requested page? 
He asked me to write the code for finding the middle of a linked list in one pass.
After that, I had to write the code for the implementation of a queue. I first discussed the approaches with him using array and linked lists for some time. They wrote the code using a linked list by taking head and tail pointer.
He was satisfied with it and the round ended with me asking him the questions I had.

1. Middle of Linked List
Easy
20m average time
80% success
0/40
Asked in companies
IBMHCL TechnologiesGenpact

Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we ret...

View more
Problem approach

Traverse linked list using two pointers. Move one pointer by one and the other pointers by two. When the fast pointer reaches the end slow pointer will reach the middle of the linked list.
 

Try solving now
2. Data structure Question

Explain queue. (Learn)

Start a Discussion
Similar interview experiences
company logo
SDE - Intern
3 rounds | 11 problems
Interviewed by Goldman Sachs
4939 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Goldman Sachs
400 views
1 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Goldman Sachs
268 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 14 problems
Interviewed by Goldman Sachs
152 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
10806 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
9343 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
7263 views
2 comments
0 upvotes