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
- Island PerimetereasyArrayDepth-First SearchBreadth-First SearchMatrixfrequency 20.0
- Jump Game VIIImediumArrayDynamic ProgrammingStackGraph Theory+2frequency 20.0
- Kth Distinct String in an ArrayeasyArrayHash TableStringCountingfrequency 20.0
- Largest Multiple of ThreehardArrayMathDynamic ProgrammingGreedy+1frequency 20.0
- Largest Unique NumbereasyArrayHash TableSortingfrequency 20.0
- Last Stone Weight IImediumArrayDynamic ProgrammingKnapsack Problem0-1 Knapsackfrequency 20.0
- Lexicographically Minimum String After Removing StarsmediumHash TableStringStackGreedy+1frequency 20.0
- Longest Square Streak in an ArraymediumArrayHash TableBinary SearchDynamic Programming+1frequency 20.0
- Longest Subarray of 1's After Deleting One ElementmediumArrayDynamic ProgrammingSliding Windowfrequency 20.0
- Longest Winning StreakhardDatabasefrequency 20.0
- Make Three Strings EqualeasyStringfrequency 20.0
- Matrix Diagonal SumeasyArrayMatrixfrequency 20.0
- Max Dot Product of Two SubsequenceshardArrayDynamic ProgrammingLongest Common Subsequencefrequency 20.0
- Maximal Range That Each Element Is Maximum in ItmediumArrayStackMonotonic Stackfrequency 20.0
- Maximize Distance to Closest PersonmediumArrayfrequency 20.0
- Maximize Points After Choosing K TasksmediumArrayGreedySortingHeap (Priority Queue)frequency 20.0
- Maximize Subarrays After Removing One Conflicting PairhardArraySegment TreeEnumerationPrefix Sumfrequency 20.0
- Maximize the Beauty of the GardenhardArrayHash TableGreedyPrefix Sumfrequency 20.0
- Maximum Average SubtreemediumTreeDepth-First SearchBinary Treefrequency 20.0
- Maximum Balanced Subsequence SumhardArrayBinary SearchDynamic ProgrammingBinary Indexed Tree+1frequency 20.0
- Maximum Calories Burnt from JumpsmediumArrayTwo PointersGreedySortingfrequency 20.0
- Maximum Linear Stock ScoremediumArrayHash Tablefrequency 20.0
- Maximum Performance of a TeamhardArrayGreedySortingHeap (Priority Queue)frequency 20.0
- Maximum Score After Binary SwapsmediumArrayStringGreedyHeap (Priority Queue)frequency 20.0
- Maximum Subarray Sum After MultipliermediumArrayDynamic Programmingfrequency 20.0
- Maximum Sum Score of ArraymediumArrayPrefix Sumfrequency 20.0
- Maximum Sum of Almost Unique SubarraymediumArrayHash TableSliding Windowfrequency 20.0
- Maximum Total Value of Covered IndicesmediumArrayStringDynamic ProgrammingGreedyfrequency 20.0
- Maximum of Minimum Values in All SubarraysmediumArrayStackMonotonic StackCartesian Treefrequency 20.0
- Merge Operations to Turn Array Into a PalindromemediumArrayTwo PointersGreedyfrequency 20.0
- Minimize the Difference Between Target and Chosen ElementsmediumArrayDynamic ProgrammingMatrixfrequency 20.0
- Minimum Average of Smallest and Largest ElementseasyArrayTwo PointersSortingfrequency 20.0
- Minimum Cost to Connect SticksmediumArrayGreedyHeap (Priority Queue)frequency 20.0
- Minimum Cost to Partition a Binary StringhardStringDivide and ConquerPrefix Sumfrequency 20.0
- Minimum Degree of a Connected Trio in a GraphhardGraph TheoryEnumerationfrequency 20.0
- Minimum Depth of Binary TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 20.0
- Minimum Difference Between Highest and Lowest of K ScoreseasyArraySliding WindowSortingfrequency 20.0
- Minimum Garden Perimeter to Collect Enough ApplesmediumMathBinary Searchfrequency 20.0
- Minimum Limit of Balls in a BagmediumArrayBinary Searchfrequency 20.0
- Minimum Money Required Before TransactionshardArrayGreedySortingfrequency 20.0
- Minimum Number of Increments on Subarrays to Form a Target ArrayhardArrayDynamic ProgrammingStackGreedy+1frequency 20.0
- Minimum Numbers of Function Calls to Make Target ArraymediumArrayGreedyBit Manipulationfrequency 20.0
- Minimum Operations to Make the Array K-IncreasinghardArrayBinary SearchLongest Increasing Subsequencefrequency 20.0
- Minimum Operations to Remove Adjacent Ones in MatrixhardArrayDepth-First SearchGraph TheoryMatrix+5frequency 20.0
- Minimum Right Shifts to Sort the ArrayeasyArrayfrequency 20.0
- Minimum Sensors to Cover GridmediumMathfrequency 20.0
- Minimum Space Wasted From PackaginghardArrayBinary SearchSortingPrefix Sumfrequency 20.0
- Minimum Swaps to Group All 1's Together IImediumArraySliding Windowfrequency 20.0
- N-th Tribonacci NumbereasyMathDynamic ProgrammingMemoizationfrequency 20.0
- Nearest Exit from Entrance in MazemediumArrayBreadth-First SearchMatrixfrequency 20.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.