Amazon SDE I Intern Interview Experience (2027 Batch) | OA + Technical Interview

Hi everyone!

I recently interviewed for the Amazon SDE I Intern role (Job ID: 10488368) after completing the online assessment. I am sharing my interview experience to help other students preparing for Amazon SDE internship interviews.

Interview Details

• Company: Amazon
• Role: SDE I Intern
• Batch: 2027
• Interview duration: 60 minutes
• Interview mode: Virtual
• Coding platform: Amazon LiveCode

Technical Interview Experience

The interview involved problem-solving using data structures and algorithms. Here are the coding questions I encountered.

Question 1: Amazon Delivery Partners (Grid / Connected Components)

We are given an m × n grid representing a delivery area. Each cell contains either '1', representing a house, or '0', representing an empty location.

A delivery partner can serve multiple houses, but only if those houses are connected. Houses belonging to separate connected groups require different delivery partners.

Task: Return the minimum number of delivery partners required to serve all houses.

Approach: I used the connected components concept with DFS. Whenever an unvisited house was found, I incremented the count and explored all connected houses, marking them as visited.

Complexity:

• Time: O(m × n)
• Auxiliary space: O(m × n) in the worst case due to the recursive DFS stack.

This question tests grid traversal, DFS/BFS, connected components, and complexity analysis.

Question 2: Binary Tree Spiral Order Traversal

Given the root of a binary tree, print its nodes in spiral order, also known as zigzag level order traversal.

For example:

        1
       / \
      2   3
     / \ / \
    4  5 6  7

Output:

1 3 2 4 5 6 7

Approach: Use two stacks to process alternate levels in opposite directions. The first stack processes one level, while the second processes the next level in reverse order. The order in which children are pushed determines the traversal direction.

Complexity:

• Time: O(n)
• Auxiliary space: O(n)

This question tests binary trees, stack operations, traversal patterns, and edge-case handling.

Preparation Tips

Based on my experience, I would recommend focusing on:

• Arrays and strings
• Hashing and common DSA patterns
• Binary trees and tree traversals
• Graphs, grids, DFS, and BFS
• Greedy algorithms and dynamic programming
• Time and space complexity
• Dry-running solutions and explaining the approach before coding

I would also recommend practising writing complete solutions in your preferred programming language rather than only understanding the logic.

Final Thoughts

The experience reinforced the importance of recognizing the underlying DSA pattern and communicating the approach clearly. Practising connected components and tree traversal problems can be particularly useful for similar interviews.

Interview result: Awaited.

I hope this helps other candidates preparing for Amazon SDE internship interviews. Good luck to everyone preparing!