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 SDE-1 Interview Experience | University Talent | India
Summary
I recently completed my interview process with Amazon for an SDE-1 role, which included an Online Assessment, two technical rounds, and a behavioral/LP round. I successfully received an offer after completing all rounds.
Full Experience
Hi everyone!
I recently completed my interview process with Amazon, and I’d like to share my experience. Hope it helps others in their prep!
🎓 Background:
- 2024 Graduate (Tier-1 college)
- 10 months experience at a startup
- LeetCode Rating: 1950, Codeforces: 1450
Round 1: Online Assessment (OA)
📅 Date: 15th Feb 2025
- 2 Easy-Medium DSA problems (don’t remember exact ones) Finished in ~20 minutes
- behavioral questions
Got a call on 7th May for scheduling! (yes, 3 months after OA 😅)
Round 2: Technical Interview
📅 Date: 9th May 2025
- Q1: BFS/DFS-based 2D matrix question (similar to Rotten Oranges)
- 1LP Question
- Q2: Predict the Winner
- Solved using recursion + DP
- Follow-up: How to get individual scores?
- Answered using total sum and difference logic (a + b = total, a - b = diff)
Got a call same day for Round 3 scheduling!
Round 3: Technical Interview
📅 Date: 13th May 2025
- Started with 2 Leadership Principle (LP) questions
- Q1: K-th Largest Sum of Contiguous Subarray
- Gave O(N² log K) solution using subarray sums + min heap
- Q2: Longest Subarray with At Most K Frequency
- Solved using 2-pointer approach
Got a call after 2days for Round 4 scheduling!
Round 4: Behavioral + LP
📅 Date: 16th May 2025
- 2 Leadership Principles Questions, Discussed on projects
- Went well overall
Now waiting for the results... fingers crossed 🤞
Update:(21/05/2025) Got the Offer🎈
Interview Questions (4)
A 2D matrix problem solvable with BFS or DFS, similar to the 'Rotten Oranges' problem (LeetCode 994), which typically involves finding shortest paths or connected components on a grid.
Find the K-th largest sum among all possible contiguous subarrays of a given array.
Find the length of the longest subarray where each element appears at most K times.