Goldman Sachs Software Developer Intern Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Hard

Timing was 10 AM. Environment was very well. Questions were well explained.

Q1. 
Minimum Umbrellas Problem
You are provided with ‘N’ types of umbrellas, where each umbrella type can shelter a certain number of people. Given an array UMBRELLA that indicates the number of people each um...read more
Ans. Brute Force
Approach: The idea here is to try every possible option and consider the minimum ans.

 We have two possible options: either we use the i-th umbrella to cover people or not. 

So, the recurrence for the above problem is:
minNumberOfUmbrellas(i, M) = min(minNumberOfUmbrellas(i - 1, M), 1+ minNumberOfUmbrellas(i, M - UMBRELLA[i])).
 
minNumberOfUmbrellas(i, M) represents the minimum number of umbrellas...read more
Answered Anonymously
Add your answer
Q2. 
Minimum Number of Swaps to Sort an Array
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
Input:
T (number of test cases)
For each test case:
N (siz...read more
Ans. Naive Approach
While iterating over the array, check the current element, and if not in the correct place, replace that element with the index of the element which should have come in this place.
 
Below is the algorithm:
1. Create a copy of the given input array and store it in temp.
2. Sort the temp array.
3. Iterate over the input array, and check whether the current element is at the right place or not by comparing it with t...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Timing was 10 AM. Environment was very well. Questions were well explained.

Q1. 
Minimum Umbrellas Problem
You are provided with ‘N’ types of umbrellas, where each umbrella type can shelter a certain number of people. Given an array UMBRELLA that indicates the number of people each um...read more
Ans. Brute Force
Approach: The idea here is to try every possible option and consider the minimum ans.

 We have two possible options: either we use the i-th umbrella to cover people or not. 

So, the recurrence for the above problem is:
minNumberOfUmbrellas(i, M) = min(minNumberOfUmbrellas(i - 1, M), 1+ minNumberOfUmbrellas(i, M - UMBRELLA[i])).
 
minNumberOfUmbrellas(i, M) represents the minimum number of umbrellas...read more
Answered Anonymously
Add your answer
Q2. 
Candies Distribution Problem Statement
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...read more
Ans. Brute Force
There can be four cases :
 
CASE 1: STUDENTS[i - 1]  > STUDENTS[i]  < STUDENTS[i + 1]
CASE 2: STUDENTS[i - 1]  < STUDENTS[i]  < STUDENTS[i + 1]
CASE 3: STUDENTS[i - 1]  > STUDENTS[i]  > STUDENTS[i + 1]
CASE 4: STUDENTS[i - 1]  < STUDENTS[i]  > STUDENTS[i + 1]
 
1. For case 1, the ‘i’th child will get one candy.
2. For case 2, the ‘i’th child will ge...read more
Answered Anonymously
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

This round was held in the evening at 6 o'clock on Hackerrank. It had coding questions: easy, medium, and hard level and MCQ's ( 1 minute for each MCQ). Negative marking was also there

Q1. 
Excel Column Number Problem Statement
Given a column title as it appears in an Excel sheet, return its corresponding column number.
Example:
Input:
"AB"
Output:
28
Explanation:
Column title "AB" co...read more
Add your answer
Q2. 
Climbing the Leaderboard Problem Statement
In a game leaderboard, scores determine rankings where the highest score gets rank 1. Players with identical scores share the same rank, followed by the next ran...read more
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was an interview round ( technical round) that was held on video-call and a coding platform was also shared. The interviewer was very friendly with me . She was praising me on every solution that I provided.

Q1. 
Flatten The Multi-Level Linked List
You are given a multi-level linked list of N nodes, where each node can have two pointers: next and child. Flatten this multi-level linked list into a singly linked lis...read more
Add your answer
Q2. 
The Celebrity Problem
Imagine there are 'N' people at a party, each assigned a unique ID from 0 to N-1. A celebrity at the party is a person who is known by everyone but knows no one else.
Problem Statem...read more
Add your answer

Round duration - 35 minutes
Round difficulty - Easy

This was an interview round ( technical round) that was held on video-call and a coding platform was also shared. The interviewer was very friendly with me . She was praising me on every solution that I provided.

Q1. 
Design a HashSet
Create a HashSet data structure without using any built-in hash table libraries.
Functions Description:
1) Constructor: Initializes the data members as required.

2) add(value): Inserts...read more
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

Online HR+Technical Round .

Round duration - 120 minutes
Round difficulty - Medium

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

 

Q1. 
Consecutive Sum Representation of a Number
Find the number of ways the given number 'N' can be expressed as the sum of two or more consecutive natural numbers.
Example:
Input:
N = 9
Output:
2
Explan...read more
Add your answer
Q2. 
Count Pairs with Given Sum
Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
Input:
The first line c...read more
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

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.

Q1. 
Cousin Nodes in a Binary Tree
Determine if two nodes in a binary tree are cousins. Nodes are considered cousins if they are at the same level and have different parents.
Explanation:
In a binary tree, e...read more
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

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.

Q1. 
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...read more
Add your answer