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
- Distance Between Bus StopseasyArrayfrequency 15.7
- Dota2 SenatemediumStringGreedyQueuefrequency 15.7
- Earliest Finish Time for Land and Water Rides IeasyArrayTwo PointersBinary SearchGreedy+1frequency 15.7
- Earliest Finish Time for Land and Water Rides IImediumArrayTwo PointersBinary SearchGreedy+1frequency 15.7
- Employee Free TimehardArraySweep LineSortingHeap (Priority Queue)frequency 15.7
- Fair Candy SwapeasyArrayHash TableBinary SearchSortingfrequency 15.7
- Final Value of Variable After Performing OperationseasyArrayStringSimulationfrequency 15.7
- Find Kth Bit in Nth Binary StringmediumStringRecursionSimulationfrequency 15.7
- Find Resultant Array After Removing AnagramseasyArrayHash TableStringSortingfrequency 15.7
- Find Smallest Letter Greater Than TargeteasyArrayBinary Searchfrequency 15.7
- Find Target Indices After Sorting ArrayeasyArrayBinary SearchSortingfrequency 15.7
- Find the Minimum Area to Cover All Ones ImediumArrayMatrixfrequency 15.7
- Fraction to Recurring DecimalmediumHash TableMathStringfrequency 15.7
- Friend Requests II: Who Has the Most FriendsmediumDatabasefrequency 15.7
- Guess Number Higher or LowereasyBinary SearchInteractivefrequency 15.7
- Invalid TransactionsmediumArrayHash TableStringSortingfrequency 15.7
- Investments in 2016mediumDatabasefrequency 15.7
- Jump Game IVhardArrayHash TableBreadth-First Searchfrequency 15.7
- K-th Smallest in Lexicographical OrderhardTriefrequency 15.7
- Last Person to Fit in the BusmediumDatabasefrequency 15.7
- Length of Longest Fibonacci SubsequencemediumArrayHash TableDynamic Programmingfrequency 15.7
- Make Lexicographically Smallest Array by Swapping ElementsmediumArrayUnion-FindSortingfrequency 15.7
- Maximum Balanced ShipmentsmediumArrayDynamic ProgrammingStackGreedy+1frequency 15.7
- Maximum Difference Between Even and Odd Frequency IeasyHash TableStringCountingfrequency 15.7
- Maximum Difference Between Increasing ElementseasyArrayfrequency 15.7
- Maximum Length of Subarray With Positive ProductmediumArrayDynamic ProgrammingGreedyfrequency 15.7
- Maximum Level Sum of a Binary TreemediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 15.7
- Maximum Number of Events That Can Be Attended IIhardArrayBinary SearchDynamic ProgrammingSortingfrequency 15.7
- Maximum Population YeareasyArrayCountingPrefix Sumfrequency 15.7
- Maximum Subarray Min-ProductmediumArrayStackMonotonic StackPrefix Sum+1frequency 15.7
- Maximum Subarray Sum With Length Divisible by KmediumArrayHash TablePrefix Sumfrequency 15.7
- Maximum Sum of 3 Non-Overlapping SubarrayshardArrayDynamic ProgrammingSliding WindowPrefix Sumfrequency 15.7
- Maximum Tastiness of Candy BasketmediumArrayBinary SearchGreedySortingfrequency 15.7
- Maximum Total Damage With Spell CastingmediumArrayHash TableTwo PointersBinary Search+3frequency 15.7
- Minimum Cost Path with Edge ReversalsmediumGraph TheoryHeap (Priority Queue)Shortest Pathfrequency 15.7
- Minimum Cost of Buying Candies With DiscounteasyArrayGreedySortingfrequency 15.7
- Minimum Domino Rotations For Equal RowmediumArrayGreedyfrequency 15.7
- Minimum Insertion Steps to Make a String PalindromehardStringDynamic Programmingfrequency 15.7
- Minimum Knight MovesmediumBreadth-First SearchHeuristic SearchBidirectional SearchA* Searchfrequency 15.7
- Minimum Moves to Make Array ComplementarymediumArrayHash TablePrefix Sumfrequency 15.7
- Minimum Number of Swaps to Make the String BalancedmediumTwo PointersStringStackGreedy+1frequency 15.7
- Minimum Operations to Make Binary Array Elements Equal to One ImediumArrayBit ManipulationQueueSliding Window+1frequency 15.7
- Minimum Pair Removal to Sort Array IIhardArrayHash TableLinked ListHeap (Priority Queue)+3frequency 15.7
- Minimum Penalty for a ShopmediumStringPrefix Sumfrequency 15.7
- Minimum Time to Complete TripsmediumArrayBinary Searchfrequency 15.7
- Monotonic ArrayeasyArrayfrequency 15.7
- Number of Longest Increasing SubsequencemediumArrayDynamic ProgrammingBinary Indexed TreeSegment Tree+1frequency 15.7
- Number of Matching SubsequencesmediumArrayHash TableStringBinary Search+3frequency 15.7
- Number of People Aware of a SecretmediumDynamic ProgrammingQueueSimulationfrequency 15.7
- Number of Sub-arrays With Odd SummediumArrayMathDynamic ProgrammingPrefix Sumfrequency 15.7
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.