amazon logo
Amazon· SDE Intern

Amazon SDE Intern Interview Experience

Posted
13 Feb 2026
408 reads

Summary

My interview consisted of one technical round focusing on DSA fundamentals and problem-solving. I discussed solutions for deep copying a linked list with random pointers and finding the next higher-rated movie, including optimizations and detailed explanations.

How it went

The interview consisted of one technical round, focused on DSA fundamentals + problem-solving depth.

Question 1: Deep Copy of Linked List (with Random Pointer)

The interviewer explored the concept in depth.

My Approach:

  • First explained brute force using HashMap (O(n) space)
  • Then optimized to O(1) space using node interleaving

Follow-ups:

  1. What do key & value represent? → The original node acts as the key and its copied node as the value.
  2. Can we do deep copy without extra space? → Yes, using the interweaving technique with O(1) auxiliary space.
  3. Why separate linked lists? → To ensure changes in the copied list don’t affect the original.
  4. Dry Run- hashmap solution.
  5. Optimisation & Time Complexity/ Space Complexity
  6. Edge cases.

Question 2: Next Higher Rated Movie

Given a list of movies with ratings, find the next movie on the right with a higher rating.

My Approach:

Used Monotonic Stack (Next Greater Element pattern).

Follow-ups:

  1. Why traverse from right?
  2. When would brute force fail?
  3. Can we do it without stack?

It was a concept-heavy and discussion-oriented interview.

Questions asked (2)

  1. 01

    Deep Copy of Linked List with Random Pointer

    Data Structures & Algorithms

    Deep Copy of Linked List (with Random Pointer). The interviewer explored the concept in depth. Follow-ups included:

    1. What do key & value represent?
    2. Can we do deep copy without extra space?
    3. Why separate linked lists?
    4. Dry Run- hashmap solution.
    5. Optimisation & Time Complexity/ Space Complexity
    6. Edge cases.
  2. 02

    Next Higher Rated Movie

    Data Structures & Algorithms

    Given a list of movies with ratings, find the next movie on the right with a higher rating. Follow-ups included:

    1. Why traverse from right?
    2. When would brute force fail?
    3. Can we do it without stack?

How they prepared

I suggest two things:

  1. You should always have an answer for:
    1. Why you're using this DS? what advantage that gives in this PS?
    2. Why you're doing this step?
    3. Can you optimize this?
    4. Run me through a test case.
    5. What's the TC/ SC?
  2. Think aloud clearly.

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!