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
- Minimum Total Cost to Make Arrays UnequalhardArrayHash TableGreedyCountingfrequency 5.0
- Minimum Total Distance TraveledhardArrayDynamic ProgrammingSortingfrequency 5.0
- Minimum Unique Word AbbreviationhardArrayStringBacktrackingBit Manipulationfrequency 5.0
- Minimum Value to Get Positive Step by Step SumeasyArrayPrefix Sumfrequency 5.0
- Missing Number In Arithmetic ProgressioneasyArrayMathfrequency 5.0
- Non-decreasing ArraymediumArrayfrequency 5.0
- Non-decreasing SubsequencesmediumArrayHash TableBacktrackingBit Manipulationfrequency 5.0
- Number ComplementeasyBit Manipulationfrequency 5.0
- Number of Changing KeyseasyStringfrequency 5.0
- Number of Closed IslandsmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 5.0
- Number of Days Between Two DateseasyMathStringfrequency 5.0
- Number of EnclavesmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 5.0
- Number of Paths with Max ScorehardArrayDynamic ProgrammingMatrixfrequency 5.0
- Number of Subarrays That Match a Pattern ImediumArrayRolling HashString MatchingHash Functionfrequency 5.0
- Number of Subarrays With LCM Equal to KmediumArrayMathNumber Theoryfrequency 5.0
- Number of Substrings With Only 1smediumMathStringfrequency 5.0
- Number of Unique Good SubsequenceshardStringDynamic Programmingfrequency 5.0
- Number of Unique XOR Triplets ImediumArrayMathBit Manipulationfrequency 5.0
- Number of Ways to Assign Edge Weights IIhardArrayMathDynamic ProgrammingBit Manipulation+2frequency 5.0
- Number of Ways to Form a Target String Given a DictionaryhardArrayStringDynamic Programmingfrequency 5.0
- Number of ZigZag Arrays IIhardMathDynamic Programmingfrequency 5.0
- Odd String DifferenceeasyArrayHash TableStringfrequency 5.0
- Operations on TreemediumArrayHash TableTreeDepth-First Search+2frequency 5.0
- Painting a Grid With Three Different ColorshardDynamic ProgrammingGraph Coloringfrequency 5.0
- Path Existence Queries in a Graph IIhardArrayTwo PointersBinary SearchDynamic Programming+4frequency 5.0
- Path with Maximum ProbabilitymediumArrayGraph TheoryHeap (Priority Queue)Shortest Path+1frequency 5.0
- Pizza Toppings Cost AnalysismediumDatabasefrequency 5.0
- Prime Subtraction OperationmediumArrayMathBinary SearchGreedy+1frequency 5.0
- Print Binary TreemediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 5.0
- Promise Time Limitmediumfrequency 5.0
- Properties GraphmediumArrayHash TableDepth-First SearchBreadth-First Search+2frequency 5.0
- Put Boxes Into the Warehouse ImediumArrayGreedySortingfrequency 5.0
- Race CarhardDynamic ProgrammingHeuristic SearchA* Searchfrequency 5.0
- Random Pick with BlacklisthardArrayHash TableMathBinary Search+2frequency 5.0
- Range AdditionmediumArrayPrefix Sumfrequency 5.0
- Range Addition IIeasyArrayMathfrequency 5.0
- Range Frequency QueriesmediumArrayHash TableBinary SearchDesign+1frequency 5.0
- Range Sum Query - MutablemediumArrayDivide and ConquerDesignBinary Indexed Tree+2frequency 5.0
- Remove Digit From Number to Maximize ResulteasyStringGreedyEnumerationfrequency 5.0
- Remove Duplicates From an Unsorted Linked ListmediumHash TableLinked Listfrequency 5.0
- Remove Max Number of Edges to Keep Graph Fully TraversablehardUnion-FindGraph Theoryfrequency 5.0
- Remove Stones to Minimize the TotalmediumArrayGreedyHeap (Priority Queue)frequency 5.0
- Reshape Data: Melteasyfrequency 5.0
- Reshape Data: Pivoteasyfrequency 5.0
- Restore the Array From Adjacent PairsmediumArrayHash TableDepth-First Searchfrequency 5.0
- Reverse Substrings Between Each Pair of ParenthesesmediumStringStackBracket Sequencesfrequency 5.0
- Score of ParenthesesmediumStringStackBracket Sequencesfrequency 5.0
- Second Minimum Node In a Binary TreeeasyTreeDepth-First SearchBinary Treefrequency 5.0
- Second Minimum Time to Reach DestinationhardBreadth-First SearchGraph TheoryShortest PathDijkstra's Algorithm+1frequency 5.0
- Select K Disjoint Special SubstringsmediumHash TableStringDynamic ProgrammingGreedy+1frequency 5.0
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.