Problems
Callback's own problems and the LeetCode questions companies have been asking, in one place — filter by category, company, topic, difficulty, and how recently a question showed up.
Asked on LeetCode
2,011 questions at Amazon · all time
- Find Triangular Sum of an ArraymediumArrayMathSimulationCombinatorics+1frequency 40.8
- Furthest Building You Can ReachmediumArrayGreedyHeap (Priority Queue)frequency 40.8
- House Robber IImediumArrayDynamic Programmingfrequency 40.8
- Kth Largest Element in a StreameasyTreeDesignBinary Search TreeHeap (Priority Queue)+2frequency 40.8
- Kth Missing Positive NumbereasyArrayBinary Searchfrequency 40.8
- Maximum Points You Can Obtain from CardsmediumArraySliding WindowPrefix Sumfrequency 40.8
- Search in Rotated Sorted Array IImediumArrayBinary Searchfrequency 40.8
- Swap Nodes in PairsmediumLinked ListRecursionfrequency 40.8
- Trapping Rain Water IIhardArrayBreadth-First SearchHeap (Priority Queue)Matrixfrequency 40.8
- Unique Paths IImediumArrayDynamic ProgrammingMatrixfrequency 40.8
- 01 MatrixmediumArrayDynamic ProgrammingBreadth-First SearchMatrixfrequency 40.2
- Assign CookieseasyArrayTwo PointersGreedySorting+1frequency 40.2
- Critical Connections in a NetworkhardDepth-First SearchGraph TheoryBiconnected ComponentBridge (Graph)frequency 40.2
- Exclusive Time of FunctionsmediumArrayStackfrequency 40.2
- Max Area of IslandmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 40.2
- Ransom NoteeasyHash TableStringCountingfrequency 40.2
- Sum of Total Strength of WizardshardArrayStackMonotonic StackPrefix Sumfrequency 40.2
- Average Selling PriceeasyDatabasefrequency 39.5
- Big CountrieseasyDatabasefrequency 39.5
- Clone GraphmediumHash TableDepth-First SearchBreadth-First SearchGraph Theoryfrequency 39.5
- Design TwittermediumHash TableLinked ListDesignHeap (Priority Queue)frequency 39.5
- Making A Large IslandhardArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 39.5
- Monthly Transactions ImediumDatabasefrequency 39.5
- Palindromic SubstringsmediumTwo PointersStringDynamic Programmingfrequency 39.5
- Smallest Range Covering Elements from K ListshardArrayHash TableGreedySliding Window+2frequency 39.5
- Sum of Subarray RangesmediumArrayStackMonotonic Stackfrequency 39.5
- Convert Sorted Array to Binary Search TreeeasyArrayDivide and ConquerTreeBinary Search Tree+1frequency 38.9
- Count Good NumbersmediumMathRecursionfrequency 38.9
- Decode WaysmediumStringDynamic Programmingfrequency 38.9
- Delete Node in a BSTmediumTreeBinary Search TreeBinary Treefrequency 38.9
- Delete Node in a Linked ListmediumLinked Listfrequency 38.9
- Design HashMapeasyArrayHash TableLinked ListDesign+1frequency 38.9
- First Bad VersioneasyBinary SearchInteractivefrequency 38.9
- Implement Queue using StackseasyStackDesignQueuefrequency 38.9
- Kids With the Greatest Number of CandieseasyArrayfrequency 38.9
- Maximum Number of Vowels in a Substring of Given LengthmediumStringSliding Windowfrequency 38.9
- Maximum Width RampmediumArrayTwo PointersStackMonotonic Stackfrequency 38.9
- Minimum Operations to Make Array Non DecreasingmediumArrayGreedyfrequency 38.9
- Recover Binary Search TreemediumTreeDepth-First SearchBinary Search TreeBinary Treefrequency 38.9
- Reverse Vowels of a StringeasyTwo PointersStringfrequency 38.9
- Wildcard MatchinghardStringDynamic ProgrammingGreedyRecursionfrequency 38.9
- Alien DictionaryhardArrayStringDepth-First SearchBreadth-First Search+3frequency 38.2
- Amount of Time for Binary Tree to Be InfectedmediumHash TableTreeDepth-First SearchBreadth-First Search+1frequency 38.2
- Coin Change IImediumArrayDynamic ProgrammingKnapsack ProblemComplete Knapsackfrequency 38.2
- Design Circular QueuemediumArrayLinked ListDesignQueuefrequency 38.2
- Design Tic-Tac-ToemediumArrayHash TableDesignMatrix+1frequency 38.2
- Find Customer RefereeeasyDatabasefrequency 38.2
- Find K Pairs with Smallest SumsmediumArrayHeap (Priority Queue)frequency 38.2
- Implement Trie (Prefix Tree)mediumHash TableStringDesignTriefrequency 38.2
- Longest Palindromic SubsequencemediumStringDynamic Programmingfrequency 38.2
Listings only — titles, difficulty, and tags link out to LeetCode. Imported from the leetcode-company-wise-problems snapshot dated 1 June 2025. Frequency is that dataset's own relative score within a company and time range.