Amazon

Challenges: 27Easy: 6Medium: 15Hard: 6

This Amazon coding interview set pulls together 27 challenges, with a mix of 6 easy, 15 medium, 6 hard. The problems lean on arrays, sliding-window, bfs, trees, dynamic-programming, so you can drill the patterns that come up most and walk into the interview ready.

Topics this company tests

Amazon coding challenges

  • Best Time to Buy and Sell Stock

    Difficulty: EasyTopics: arrays, sliding-window
  • Binary Tree Level Order Traversal

    Difficulty: MediumTopics: bfs, trees
  • Cache Invalidation Planner

    Difficulty: HardTopics: dynamic-programming, graphs, topological-sort
  • Container With Most Water

    Difficulty: MediumTopics: arrays, two-pointers
  • Contains Duplicate

    Difficulty: EasyTopics: arrays, hashing
  • Cyclic Dependency Detector

    Difficulty: MediumTopics: dfs, graphs, topological-sort
  • Group Anagrams

    Difficulty: MediumTopics: hashing, strings
  • Longest Increasing Subsequence

    Difficulty: HardTopics: arrays, binary-search, dynamic-programming
  • Longest Substring Without Repeating Characters

    Difficulty: MediumTopics: hashing, sliding-window, strings
  • Maximum Depth of Binary Tree

    Difficulty: MediumTopics: bfs, recursion, trees
  • Maximum Subarray

    Difficulty: MediumTopics: arrays, dynamic-programming
  • Meeting Room Scheduler

    Difficulty: MediumTopics: heaps, intervals, sorting
  • Merge K Sorted Lists

    Difficulty: HardTopics: divide-and-conquer, heap, linked-lists
  • Merge Two Sorted Lists

    Difficulty: EasyTopics: linked-lists
  • Min Stack

    Difficulty: MediumTopics: design, stacks
  • Multi Tenant Quota Enforcer

    Difficulty: MediumTopics: hash-map, simulation
  • Product of Array Except Self

    Difficulty: MediumTopics: arrays
  • Retry Backoff Scheduler

    Difficulty: MediumTopics: math, simulation
  • Reverse Linked List

    Difficulty: EasyTopics: linked-lists
  • Three Sum

    Difficulty: MediumTopics: arrays, sorting, two-pointers
  • Trapping Rain Water

    Difficulty: HardTopics: arrays, stacks, two-pointers
  • Two Sum

    Difficulty: EasyTopics: arrays, hashing
  • Valid Parentheses

    Difficulty: EasyTopics: stacks, strings
  • Validate Binary Search Tree

    Difficulty: MediumTopics: binary-search, recursion, trees
  • Wallet Reconciliation

    Difficulty: HardTopics: data-integrity, hash-map
  • Warehouse Slot Packing

    Difficulty: MediumTopics: greedy, sorting, two-pointers
  • Word Break

    Difficulty: HardTopics: dynamic-programming, strings

Ready to practice for real?

Work through coding challenges like the ones Amazon asks, run your code, and check your solution against real test cases.

Practice coding challenges, start free