Goldman Sachs Software Engineer Intern Interview Questions and Answers

One easy and two medium leetcode

Q1. What motivates you
Add your answer
Q2. Tell me about yourself
Add your answer

Round duration - 90 Miinutes
Round difficulty - Medium

This round contains 20 MCQ questions and 2 Coding questions and It was 90 minutes round
Timings were of the morning
This round was online on hackerrank platform
There was proper procuring with web cam 
MCQ questions were from aptitude and oops section
Coding Questions : 1st question is medium level question, 2nd was a little bit tough question for me
Overall it was medium level in toughness

Q1. 
Connecting Ropes with Minimum Cost
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...read more
Ans. 
The problem is to connect N ropes of different lengths into one rope with minimum cost.
• Sort the array of rope lengths in ascending order.

• Initialize a variable to keep track of the total cost.

• While there are more than one rope remaining, take the two shortest ropes and connect them.

• Add the cost of connecting the two ropes to the total cost.

• Replace the two shortest ropes with the connected rope.

• Repeat the above steps unt...read more
Answered by AI
Add your answer
Q2. 
Zero Matrix Problem Statement
You are given a matrix MATRIX of dimension N x M. Your task is to make all the elements of row i and column j equal to 0 if any element in the ith row or jth column of the ma...read more
Ans. 
The task is to modify a given matrix such that if any element in a row or column is 0, then make all elements in that row and column 0.
• Iterate through the matrix and keep track of rows and columns that contain 0s

• After the first iteration, iterate through the tracked rows and columns and set all elements to 0

• Handle the case where the first row or column contains 0 separately

• To solve with O(1) space complexity, use the f...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Timing = afternoon
Environment : it was on zoom call
Interviewer was friendly, he asked one question that was tough

Q1. 
Similar Strings Problem Statement
Determine whether two given strings, A and B, both of length N, are similar by returning a 1 if they are, otherwise return a 0.
Explanation:
String A is similar to stri...read more
Ans. 
The task is to determine if two strings are similar based on the given conditions.
• Check if the strings are equal, if yes, return 1

• Divide both strings into two parts and check if any combination satisfies the similarity condition

• If none of the conditions hold true, return 0
Answered by AI
Add your answer