amazon logo
Amazon· SDE II

Amazon SDE II | DSA Round

Result
Ongoing
Posted
1 Sept 2025
334 reads

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.

How it went

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:

  1. 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.
  2. 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.

Questions asked (2)

  1. 01

    House Robber III

    Data Structures & Algorithms

    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.

  2. 02

    Most Frequently Visited Pages Sequence

    Data Structures & Algorithms

    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.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Amazon recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!