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
Amazon Interview SDE2
Summary
I interviewed for an SDE2 position at Amazon in Bangalore, which involved an online assessment followed by four rounds covering algorithms, system design, and leadership principles. Despite providing my best approaches to the problems, I was ultimately rejected.
Full Experience
YOE : 4+ Location : Bangalore Team : Payments
OA : Dont remember
- Based on some frequency
- Extended version of LIS
**Round 1 **
- https://leetcode.com/problems/cheapest-flights-within-k-stops/description/
- https://leetcode.com/problems/course-schedule-ii/description/
- 2 Question on LP's
Round 2:
2 Question on LP's
Design Moview Booking System
Don't know what actually panel wants HLD/LLD he was not coperative as well given some sort of HLD and some API contracts
Round 3:
2 Question on LP's
- https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected/
- Intead of Binary if it is N array Tree
Round 4:
Design Google Drive Gave all requirnment he asked for
Verdict : Rejected
Interview Questions (6)
There are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight from city fromi to city toi with cost pricei. You are also given three integers src, dst, and k. Return the cheapest price from src to dst with at most k stops. If there is no such route, return -1.
There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai. Return the ordering of courses you should take to finish all courses. If there are multiple valid orderings, return any of them. If it is impossible to finish all courses, return an empty array.
Design a Movie Booking System. I don't know what actually the panel wanted (HLD/LLD), and he was not cooperative. I gave some sort of HLD and some API contracts.
You are given the root of a binary tree with unique values, and an integer start. At minute 0, an infection starts from the node with value start. Each minute, a node becomes infected if it is currently uninfected and an adjacent node (parent or child) is infected. Return the number of minutes needed for the entire tree to be infected.
An extension of the 'Amount of Time for Binary Tree to Be Infected' problem, but adapted for an N-ary tree instead of a binary tree.
Design Google Drive. I gave all the requirements he asked for.