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 Adjacent Swaps to Make a Valid ArraymediumArrayGreedyfrequency 23.6
- Minimum Average DifferencemediumArrayPrefix Sumfrequency 23.6
- Minimum Cost to Merge StoneshardArrayDynamic ProgrammingPrefix Sumfrequency 23.6
- Minimum Difficulty of a Job SchedulehardArrayDynamic Programmingfrequency 23.6
- Minimum Length of String After Deleting Similar EndsmediumTwo PointersStringfrequency 23.6
- Minimum Number of Operations to Make Array EmptymediumArrayHash TableGreedyCountingfrequency 23.6
- Minimum Operations to Reduce X to ZeromediumArrayHash TableBinary SearchSliding Window+1frequency 23.6
- Minimum Stability Factor of ArrayhardArrayMathBinary SearchGreedy+2frequency 23.6
- Monotone Increasing DigitsmediumMathGreedyfrequency 23.6
- Most Frequent IDsmediumArrayHash TableHeap (Priority Queue)Ordered Setfrequency 23.6
- Movie RatingmediumDatabasefrequency 23.6
- Next Palindrome Using Same DigitshardTwo PointersStringfrequency 23.6
- Number of Digit OnehardMathDynamic ProgrammingRecursionfrequency 23.6
- Number of Laser Beams in a BankmediumArrayMathStringMatrixfrequency 23.6
- Number of Subsequences That Satisfy the Given Sum ConditionmediumArrayTwo PointersBinary SearchSortingfrequency 23.6
- Path With Maximum Minimum ValuemediumArrayBinary SearchDepth-First SearchBreadth-First Search+4frequency 23.6
- Percentage of Users Attended a ContesteasyDatabasefrequency 23.6
- Perfect SquaresmediumMathDynamic ProgrammingBreadth-First SearchKnapsack Problem+1frequency 23.6
- Product Sales Analysis IVmediumDatabasefrequency 23.6
- Remove Nodes From Linked ListmediumLinked ListStackRecursionMonotonic Stackfrequency 23.6
- Remove Palindromic SubsequenceseasyTwo PointersStringfrequency 23.6
- Remove Sub-Folders from the FilesystemmediumArrayStringDepth-First SearchTriefrequency 23.6
- Reorder Routes to Make All Paths Lead to the City ZeromediumDepth-First SearchBreadth-First SearchGraph Theoryfrequency 23.6
- Reverse String IIeasyTwo PointersStringfrequency 23.6
- Reverse Words in a String IImediumTwo PointersStringfrequency 23.6
- Shortest Matching SubstringhardTwo PointersStringBinary SearchString Matchingfrequency 23.6
- Smallest Subarrays With Maximum Bitwise ORmediumArrayBinary SearchBit ManipulationSliding Windowfrequency 23.6
- Snapshot ArraymediumArrayHash TableBinary SearchDesign+1frequency 23.6
- Solve the EquationmediumMathStringSimulationLinear Algebrafrequency 23.6
- Split With Minimum SumeasyMathGreedySortingfrequency 23.6
- The K Weakest Rows in a MatrixeasyArrayBinary SearchSortingHeap (Priority Queue)+1frequency 23.6
- The Number of Employees Which Report to Each EmployeeeasyDatabasefrequency 23.6
- The Skyline ProblemhardArrayDivide and ConquerBinary Indexed TreeSegment Tree+4frequency 23.6
- To Be Or Not To Beeasyfrequency 23.6
- Trionic Array IIhardArrayDynamic Programmingfrequency 23.6
- Two Best Non-Overlapping EventsmediumArrayBinary SearchDynamic ProgrammingSorting+1frequency 23.6
- Two Sum BSTsmediumTwo PointersBinary SearchStackTree+3frequency 23.6
- Two Sum Less Than KeasyArrayTwo PointersBinary SearchSortingfrequency 23.6
- Unique Length-3 Palindromic SubsequencesmediumHash TableStringBit ManipulationPrefix Sumfrequency 23.6
- Unique Paths IIIhardArrayBacktrackingBit ManipulationMatrix+1frequency 23.6
- Walls and GatesmediumArrayBreadth-First SearchMatrixfrequency 23.6
- Word PatterneasyHash TableStringfrequency 23.6
- Adding Spaces to a StringmediumArrayTwo PointersStringSimulationfrequency 21.9
- Append Characters to String to Make SubsequencemediumTwo PointersStringGreedyfrequency 21.9
- Binary Tree PathseasyStringBacktrackingTreeDepth-First Search+1frequency 21.9
- Check If N and Its Double ExisteasyArrayHash TableTwo PointersBinary Search+1frequency 21.9
- Check if Move is LegalmediumArrayMatrixEnumerationfrequency 21.9
- Closest DivisorsmediumMathPrime Factorizationfrequency 21.9
- Closest RoomhardArrayBinary SearchSortingOrdered Setfrequency 21.9
- Construct String from Binary TreemediumStringTreeDepth-First SearchBinary Treefrequency 21.9
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.