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 | Analyst | Bangalore | September 2021 | Reject
Summary
I interviewed for an Analyst position at Goldman Sachs in Bangalore with 2 years of prior IT experience. Despite clearing the online assessment and two coder pad rounds, I was unfortunately rejected after the first technical round of the Super day.
Full Experience
I was initially contacted by a recruiter on LinkedIn regarding an Analyst position at Goldman Sachs in Bangalore. With 2 years of previous IT experience in an investment bank, I proceeded with their hiring process. The first step was an online assessment, followed by two separate coder pad rounds, each an hour long and conducted face-to-face with an analyst. After successfully navigating these, I was scheduled for a Super day, which was planned to consist of three rounds: two technical interviews and one with a hiring manager. Regrettably, my journey ended there as I was rejected after completing only the first technical round of the Super day.
Interview Questions (9)
Find the number of ways to climb steps if you can only take 2, 4, or 6 steps at a time. This is a variation of the classic climbing stairs problem.
Given a string, remove characters that occur continuously for a specified length. This removal process should be repeated until no more characters can be removed further.
Convert a string like 'aaabbccc' to 'a3b2c3', where consecutive identical characters are replaced by the character followed by its count.
Given a 2D grid where each cell has some value, find the largest accumulated value you can get by starting from the bottom-left cell and ending at the top-right. You are only allowed to move up or right.
You are given an array prices where prices[i] is the price of a given stock on the i-th day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve. If you cannot achieve any profit, return 0.
There are N gas stations along a circular route, where the amount of gas at station i is available[i]. You have a car with an unlimited gas tank and it costs required[i] of gas to travel from station i to station i + 1. You start the trip with an empty tank at one of the gas stations. Return the starting gas station's index if you can travel around the circuit once, otherwise return -1. If there exists a solution, it is guaranteed to be unique.
Design and implement a Least Recently Used (LRU) cache. It should support get and put operations, both with O(1) average time complexity. Explain how to handle a cache miss.