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 | SysDE1 | Feb 2025 | Bangalore | Application Withdraw
Summary
I interviewed for the SysDE1 role at Amazon in Bangalore, undergoing two rounds focused on Data Structures & Algorithms and Leadership Principles. Ultimately, I withdrew my application after receiving an SDE offer elsewhere.
Full Experience
I received an interview invitation for the SysDE1 position at Amazon on February 18th, with my interviews scheduled between February 27th and March 3rd. I have 1+ years of experience, currently working as an SDE1 at an investment bank.
R1: DSA + Leadership Principles (Feb 27)
My first round was with an SDE3 from Amazon Germany, who had 8-9 years of experience. The round focused on Data Structures & Algorithms alongside Leadership Principles.
- Question 1: Print leaves of a Binary Tree (left to right)
- Follow-up: Print the boundary of the Binary Tree
I successfully solved both problems, explaining my approach thoroughly. I wrote the full code on the shared editor and performed a dry run, meticulously discussing the time and space complexity for each solution.
R2: DSA + Leadership Principles (Mar 3)
The second round involved two interviewers: one SDE1 with 2 years of experience and another with 10 years of experience. This round also covered DSA and Leadership Principles.
- Question 1: Minimum Platforms (Greedy / Sorting problem)
- Question 2: A string-based problem – Find the maximum frequency substring of a given size 'n' and return that string.
Again, I solved both problems effectively. I explained my approach for each, wrote the complete code, and performed a detailed dry run while discussing the time and space complexity.
R3: HM Round (Awaiting)
I received confirmation that the Hiring Manager round would be scheduled soon, but I subsequently withdrew my application as I had received another SDE offer.
Interview Questions (4)
Given a Binary Tree, print all its leaf nodes from left to right. A leaf node is a node with no children.
Given a Binary Tree, print its boundary nodes. The boundary traversal should include the left boundary (excluding leaves), all leaf nodes (from left to right), and the right boundary (excluding leaves, traversed in reverse order from bottom to top) without duplicates.
Given the arrival and departure times of all trains that arrive at a railway station, find the minimum number of platforms required for the railway station so that no train waits. This is a classic problem often solvable using a greedy approach or by sorting events.
Given a string, find the substring of a specified size 'n' that appears with the maximum frequency, and return that substring. This problem typically involves using a sliding window and a hash map (or frequency array) to count occurrences.