Microsoft SDE Intern Interview Experience
💼 LTIMindtree Interview Experience (On-Campus) | Fresher | 2026
Salesforce SMTS | Interview Experience | Rejected
JPMC | SDE2 (Associate) - Java Backend - Interview Experience + Compensation
Microsoft - SDE2 - Coding Round
Goldman sachs Internship interview experience-2020
Summary
I interviewed for a Software Engineering Internship at Goldman Sachs in 2020. The process included an online assessment, followed by two technical interviews where I discussed projects and solved various coding and logic problems. Ultimately, I was rejected.
Full Experience
As a pre-final year student from IIT(ISM) Dhanbad, I want to share my Goldman Sachs internship interview experience from 2020.
First Round: Online Test
This round consisted of two easy coding questions, one hard coding question, several aptitude questions, and CS fundamentals questions. There were also two situation-based questions. The total time allotted was 2 hours and 15 minutes.
Second Round: Technical Interview
This was a technical interview where I first introduced myself and discussed my projects in detail. Following that, the interviewer asked a specific coding question related to array rotations and finding maximum elements.
Third Round: Technical Interview
The third round was another technical interview packed with various questions. I was asked a probability question, a classic hat puzzle, another coding problem involving minimizing array sum through operations, and a logic puzzle about finding a heavier ball using a balance scale, which was extended to a larger number of balls.
Verdict
I was ultimately rejected. I believe this was due to not fully solving the coding question in the third round and failing to provide the correct answer for the extended heavier ball puzzle with 26 balls.
Interview Questions (5)
I am given an array arr[] and another array rotate[] I have to return another array whose index i stores the index of the position of the maximum element of the arr after it is left rotated rotate[i] number of times.
What is the probability of getting exactly 2 heads if 5 unbiased coins are tossed simultaneously.
There is a staircase at which 4 people are standing say 1 2 3 4 all are facing in such a way that they are moving downstairs and are in the order 1 2 3 4 (4 at the top). Now, there is a thief who has a gun and is pointing towards them and is sideways. So, they cannot see the thief and also they can only see the persons who are in front of them (they can not move their heads or mutter anything among them). The thief asked them a question and said if they will solve it he will let them free otherwise kill all of them. Assume there is a virtual wall between 3 and 4 so that 4 can not see any of the persons in front of him. The thief had 2 green and 2 red hats. He placed one hat on top of every person and asked if anyone of them can answer correctly about which colour hat they are wearing. Note that if any of them gives a wrong answer the thief will kill all of them.
I was given an arr and I have to perform max k operations and return the minimum value of sum of the array elements possible. In each operation you can select any element of the arr and replace it with the ceil value when divided by 2. Constraints:
- 1 <= arr.length <= 10^5
- 1 <= arr[i] <= 10^4
- 0 <= k <= 10^7
I am given 8 identical balls. One of them is defective and is heavier than others. You have a balance. Everytime you use the balance it costs 1 coin. What is the minimum cost to figure out which among the 8 is the heavier ball. (I answered it then the interviewer asked me to calculate the value for 26 balls).