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 II | DSA Round
Summary
I interviewed for an SDE II position at Amazon, which included a behavioral discussion and two data structure and algorithm questions: House Robber III and finding the most frequently visited page sequences. I am currently awaiting the outcome of the interview.
Full Experience
I received an invitation to apply for an SDE II role at Amazon through a LinkedIn recruiter. After submitting my application, I was sent an Online Assessment, which consisted of two standard LeetCode medium questions, though I don't recall the exact problems. Following the OA, I was scheduled for virtual interviews.
The DSA round began with a 20-25 minute discussion about my previous experience, projects, and behavioral questions focusing on delivering under pressure and the impact of my work.
Subsequently, we moved on to two data structure and algorithm questions:
- House Robber III: I initially explained a recursive approach with memoization, then an optimized version. The interviewer challenged me to further optimize space complexity, which I discussed with some ideas before moving on.
- Most Frequently Visited Pages Sequence: Given an input list of
(timestamp, userId, pageNo), I started by outlining a brute-force solution using maps to store and count the frequencies of sequences. A follow-up asked for the top-Q most frequent sequences. While I initially fumbled a bit with space complexity, I eventually discussed the correct approach.
I am currently waiting for the response from Amazon.
Interview Questions (2)
Given a binary tree representing houses, where each node contains the amount of money in that house. Robbing adjacent houses is not allowed. Determine the maximum amount of money I can rob without alerting the police. I had to discuss a recursive + memoized approach and then optimize space complexity.
Given a list of records (timestamp, userId, pageNo), find the most frequently visited sequence of pages of size 3 by customers. A follow-up question was to return the top-Q most frequent sequences instead of just the top 1.