# Goldman Sachs On-Campus Internship Procedure

• Difficulty Level : Medium
• Last Updated : 15 Aug, 2018

Online Test – Hackerrank
9 questions, 60 minutes
Q1 (Coding)
How many quadrilaterals are possible with the 4 coordinates given to you as a 2D array of 4X2?

Q2 – Q5 (MCQ)
Maximum number of comparisons in Merge Sort

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

Rotating an array by k (fill in the blanks in the code)
and 2 more.

Q6-Q7 (Paragraph based MCQ)
Pattern based encoding-decoding question

Q8-Q9 (Paragraph based MCQ)
The famous Wine Problem of Dynamic Programming with 5 wine bottles
Which wine to sell second for maximum profit? What is the maximum profit?

Interview
The questions pertained to Coding, Puzzle and HR broadly, along with some discussion on the projects your resume lists. The exact composition of questions in an interview wasn’t fixed. Generally, there were 3 rounds, if they covered all types of questions. But you may have 4 rounds also, if you had a pure Puzzle or pure HR round before.

Round 1

Puzzle – 2 eggs, 100 floors
https://www.geeksforgeeks.org/puzzle-set-35-2-eggs-and-100-floors/

Round 2
Find the size of the largest square sub-matrix having all 1s in an mxn matrix.
Given a binary tree, identify if all leaf nodes are at the same level.

Round 3
What approach did you use to solve the Coding question of the Online Test (the Quadrilaterals question mentioned above)?
What is your definition of teamwork?
Given an mxn wall, you have 3×1 and 2×1 bricks, which you need to lay horizontally in each row, such that the ends of a brick in one row do not coincide with the ends of any brick in the rows above or below it, except of course coinciding at the start and end of the wall. What approach will you use to solve the question?

Round 4