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 | Associate | Bangalore | [Result (Reject)]
Summary
I interviewed for an Associate position at Goldman Sachs in Bangalore, which included a CoderPad assessment and a SuperDay consisting of two technical rounds. Despite performing well on several technical and behavioral questions, I was ultimately rejected.
Full Experience
I had my interview experience for an Associate role at Goldman Sachs in Bangalore. The process began with a CoderPad round, followed by a SuperDay, which involved two distinct technical rounds.
CoderPad Round
This round focused on coding challenges. I was given two problems to solve:
- Find a cycle in an array: I had to implement a function that, given an integer array where elements point to indices, would find and return the length of any cycle. If no cycle was found, the function should return -1. Examples like
countLengthOfCycle([1, 0], 1) == 2andcountLengthOfCycle([1, 2, 0], 0) == 3were provided. - Highest average score: The second problem involved processing an array of score pairs, such as
scores[][] = [{“jerry”,”65”},{“bob”,”91”}, {“jerry”,”23”}, {“Eric”,”83”}], and finding the highest average score among all unique individuals. The scores could also be negative.
SuperDay - Round 1
This round was a mix of conceptual questions and a coding challenge:
- I was asked to explain what a LinkedList is and when one would choose a LinkedList over an ArrayList.
- I received a problem to rearrange a given linked list like
1->2->3->4->5to produce a new list where every alternate element (odd-indexed if 0-indexed) is moved to the end. The desired output was1->3->5->2->4. - A classic problem on grouping anagrams was presented. Given an input list of strings like
["dog", "god", "cat","act","abc","tac"], the expected output was grouped anagrams:{{"dog","god"}, {"cat","act","tac"},{"abc"}}.
SuperDay - Round 2
The final round delved into my project experience and more complex data structure/algorithm questions:
- The interviewer asked about the latest project or feature I had developed in my current organization and its impact.
- I was challenged with a problem to return the product of all values at each index excluding that index’s value, given an array of integers (both positive and negative). The interviewer emphasized covering various test cases.
- I was asked about which data structure I would use to store each user’s data in a network where many users access a resource.
- The last question involved a binary tree consisting only of 0s and 1s. I had to find a subtree where the number of 0s and 1s are equal and return
true, elsefalse.
Ultimately, after these rounds, I received a rejection and did not proceed to any further stages.
Interview Questions (9)
You are given an integer array of size N. Every element of the array is greater than or equal to 0. Starting from arr[startIndex], follow each element to the index it points to. Continue to do this until you find a cycle. Return the length of the cycle. If no cycle is found return -1.
Examples: countLengthOfCycle([1, 0], 1) == 2 , countLengthOfCycle([1, 2, 0], 0) == 3
Given an array scores[][] = [{“jerry”,”65”},{“bob”,”91”}, {“jerry”,”23”}, {“Eric”,”83”}] Find the highest average score. Numbers can be negative as well.
What is LinkedList? When do you choose LinkedList over ArrayList?
Given a linkedlist 1->2->3->4->5, return a new linkedlist with every alternate element, odd indexed element if starting as 0-indexed, being added at the last. New linkedList will look like: 1->3->5->2->4
Group anagrams from list of strings eg: I/P: ["dog", "god", "cat","act","abc","tac"] O/P: {{"dog","god"}, {"cat","act","tac"},{"abc"}}
Latest project/feature developed in current org and it's impact.
Given an array of integers, positive negative both. Return the product of all values at each index excluding that index's value. Emphasized on the test cases.
In a network, there are lot's of users coming to access a resource, which data structure will you use to store each user's data.
Given a binary tree consisting of only 0's and 1's. Find a subtree in which number of 0s and 1s are equal and return true, else return false.