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 | Full time Analyst | Bangalore | Apr 2021 [Offer]
Summary
I successfully navigated the Goldman Sachs interview process for a Full Time Analyst role in Bangalore and ultimately received an offer. The experience included an online assessment and several technical rounds, culminating in a managerial discussion.
Full Experience
My Goldman Sachs Interview Journey
Hi, I recently cleared the Goldman Sachs interview for a Full Time Analyst position in Bangalore. My journey began in February 2021 when I received a call from their recruiter. I have about 1.5 years of experience.
Round 1: Online Assessment (HackerRank)
This round consisted of two medium-level LeetCode problems. While I don't recall the exact problems, one was based on priority queues, and the other was a dynamic programming problem.
Round 2: CoderPad Round
After a brief discussion about my past experience, the interviewer moved directly to CoderPad, a collaborative coding platform. I was given two questions:
- A problem similar to Shortest Path in Binary Matrix, but with some modifications.
- Another problem involved string manipulation. The key here was ensuring all test cases passed.
After about a month, the recruiter scheduled three technical rounds for me on the same day.
Round 3: Technical-1
This round started with introductions, and then I explained my current project. Following this, I was given an easy dynamic programming problem, which I completed quickly. The interviewer then presented a backtracking problem, and we only discussed the approach.
Round 4: Technical-2
Similar to the previous round, this one began with introductions and a discussion about one of my projects. The interviewer then gave me a problem on topological sorting, specifically Course Schedule. After solving that, we had a long discussion on a probability question.
Round 5: Technical-3
Following the usual introduction and project discussion, I was asked to solve a dynamic programming problem, Minimum Cost For Tickets. The second problem required me to find the k-th lexicographically ordered string for a given input string.
Round 6: Managerial (V.P.)
This round primarily involved discussions about my projects and some behavioral questions.
Final Verdict: I received an offer! The overall interview experience was very positive, as the interviewers were helpful and polite throughout the process.
Interview Questions (4)
I was given a problem similar to 'Shortest Path in Binary Matrix' but with slight modifications. The goal was to find the shortest path from a starting cell to a target cell in a binary matrix, where 0 represents an open path and 1 represents a blocked path. The interviewer emphasized that all given test cases should pass.
The second problem was to find the k-th lexicographically ordered string that can be formed from a given input string. This typically involves permutations or combinations.