amazon logo
Amazon· SDE intern

Amazon SDE intern OA experience

Posted
21 Mar 2026
569 reads

Summary

I attended an Amazon SDE intern interview on 17/03/2026 and was given two coding questions.

How it went

I had attended an Amazon SDE intern interview on 17/03/2026 (on campus) and these were the 2 questions I got


Question 1: Warehouse Robots with Threshold

Problem Description
You are given an integer array arr of size n, where arr[i] represents the threshold of the i-th robot.
Each robot can be assigned one of two states:
Running
Waiting
A configuration is valid if all robots satisfy the following conditions:
If a robot is Running, then the total number of running robots must be ≥ arr[i]
If a robot is Waiting, then the total number of waiting robots must be < arr[i]

Task
Return the total number of valid configurations.

Constraints
Each robot must be assigned exactly one state.
A configuration is valid only if no robot violates its condition.


Question 2: Most Common Product Pair

Problem Description
You are given a list of transactions, where each transaction is a list of products purchased together.
[
['A','B','C'],
['A','B'],
['C','B'],
['A','B'],
['A','C']
]

Task
Return the pair of products that appears together most frequently across all transactions.

Rules
A pair consists of exactly two distinct products.
(A, B) and (B, A) are considered the same pair.
If multiple pairs have the same highest frequency, return the lexicographically smallest pair.

Notes
Duplicate items within a transaction should be counted only once.
Each transaction can contribute multiple pairs.

Questions asked (2)

  1. 01

    Warehouse Robots with Threshold

    Data Structures & Algorithms

    Problem Description
    You are given an integer array arr of size n, where arr[i] represents the threshold of the i-th robot.
    Each robot can be assigned one of two states:
    Running
    Waiting
    A configuration is valid if all robots satisfy the following conditions:
    If a robot is Running, then the total number of running robots must be ≥ arr[i]
    If a robot is Waiting, then the total number of waiting robots must be < arr[i]

    Task
    Return the total number of valid configurations.

    Constraints
    Each robot must be assigned exactly one state.
    A configuration is valid only if no robot violates its condition.

  2. 02

    Most Common Product Pair

    Data Structures & Algorithms

    Problem Description
    You are given a list of transactions, where each transaction is a list of products purchased together.
    [
    ['A','B','C'],
    ['A','B'],
    ['C','B'],
    ['A','B'],
    ['A','C']
    ]

    Task
    Return the pair of products that appears together most frequently across all transactions.

    Rules
    A pair consists of exactly two distinct products.
    (A, B) and (B, A) are considered the same pair.
    If multiple pairs have the same highest frequency, return the lexicographically smallest pair.

    Notes
    Duplicate items within a transaction should be counted only once.
    Each transaction can contribute multiple pairs.

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!