Build, test, explain
Clarify an original problem, implement a solution, test boundaries and explain complexity. Choose your language and practice time in the workspace.
Open coding round →BIG TECH / COMPANY-STYLE PRACTICE
Amazon-style preparation
Practice algorithms, data structures and service design. Explain customer impact and failure handling.
14 original exercises selected by ResumeWorlds. These are preparation suggestions, with no claim that Amazon asked these questions or endorses ResumeWorlds.
Why these topics?
Amazon recommends algorithms, data structures, coding, databases and distributed computing. This source supports preparation topics, not attribution of these exercises to Amazon interviews.
Read the public preparation source →Source reviewed 2026-10-10. Role and interview formats can vary; confirm your actual process with your recruiter.
A useful practice round
Choose a coding exercise, explain the approach aloud, implement it and test edge cases. Then explain time and space complexity. For design, write assumptions, compare alternatives and respond to the pressure round. Runtime results require the isolated runner to be available.
Customize and save your round sequence →
Read, repair, verify
Work with intentionally faulty code. Find a counterexample, review your diff and verify the repair with the isolated runner. Record how you evaluated AI coaching.
Open read & repair →Design under pressure
State assumptions, compare architectures and respond to a changing constraint. Existing cited coaching stays separate from executed code correctness.
Open design scenario →Company-style selections are editorial practice suggestions. View topics and source →
14 of 14 original questions
Pair a mentoring budget
Count index pairs i < j whose activity costs add to the target budget. Equal values at different indexes count separately.
Minimum review capacity
Review n positive workloads in order across at most d days. Each day takes a contiguous group. Find the smallest daily capacity that can complete every workload.
Concurrent mentoring rooms
Mentoring sessions use half-open intervals [start, end). Find the minimum number of rooms needed. A room ending at time t can be reused by a session starting at t.
Minimum practice tokens
You have unlimited tokens of each given positive value. Return the fewest tokens needed to total exactly the target, or -1 if impossible.
Count target-sum segments
Count nonempty contiguous segments whose sum equals the target.
Minimum batch processing rate
Each hour processes at most rate units from one workload; leftover hourly capacity is not shared. Find the minimum positive integer rate finishing all workloads within h hours.
Front after queue commands
Each command pair is (1,x) to enqueue x or (2,0) to remove the front if present. Return the final front, or -101 for an empty queue.
Cheapest directed service route
Return the cheapest directed source-to-target route cost, or -1 if unreachable. Source equals target has cost zero.
Cheapest route with a hop limit
Find the cheapest directed route using AT MOST k edges, not k intermediate stops. Return -1 if none qualifies.
Minimum log merge cost
Merge any two positive log sizes for cost equal to their sum; the merged log has that size. Repeat until one log remains. Return the minimum total cost.
Payment webhook reconciliation
Consume provider payment events and maintain an auditable order payment state.
Multi-service order workflow
Coordinate checkout, inventory, payment and fulfillment across independent services.
Inventory holds across warehouses
Reserve product quantities during checkout across warehouses.
Durable scheduled tasks
Run tenant tasks at scheduled times with retries and missed-run policies.