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
- Longest Common Suffix QuerieshardArrayStringTriefrequency 7.2
- Longest Cycle in a GraphhardDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+2frequency 7.2
- Longest Non-decreasing Subarray From Two ArraysmediumArrayDynamic Programmingfrequency 7.2
- Longest Path With Different Adjacent CharactershardArrayStringTreeDepth-First Search+2frequency 7.2
- Longest Turbulent SubarraymediumArrayDynamic ProgrammingSliding Windowfrequency 7.2
- Matchsticks to SquaremediumArrayDynamic ProgrammingBacktrackingBit Manipulation+1frequency 7.2
- Matrix Block SummediumArrayMatrixPrefix Sumfrequency 7.2
- Max Pair Sum in an ArrayeasyArrayHash Tablefrequency 7.2
- Maximal Score After Applying K OperationsmediumArrayGreedyHeap (Priority Queue)frequency 7.2
- Maximize Score of Numbers in RangesmediumArrayBinary SearchGreedySortingfrequency 7.2
- Maximize Spanning Tree Stability with UpgradeshardBinary SearchGreedyUnion-FindGraph Theory+1frequency 7.2
- Maximum Amount of Money Robot Can EarnmediumArrayDynamic ProgrammingMatrixfrequency 7.2
- Maximum Ascending Subarray SumeasyArrayfrequency 7.2
- Maximum Building HeighthardArrayMathSortingfrequency 7.2
- Maximum Count of Positive Integer and Negative IntegereasyArrayBinary SearchCountingfrequency 7.2
- Maximum Depth of N-ary TreeeasyTreeDepth-First SearchBreadth-First Searchfrequency 7.2
- Maximum Difference Between Adjacent Elements in a Circular ArrayeasyArrayfrequency 7.2
- Maximum Difference Between Even and Odd Frequency IIhardStringSliding WindowEnumerationPrefix Sumfrequency 7.2
- Maximum Employees to Be Invited to a MeetinghardArrayDynamic ProgrammingDepth-First SearchGraph Theory+3frequency 7.2
- Maximum Frequency of an Element After Performing Operations IIhardArrayBinary SearchSliding WindowSorting+1frequency 7.2
- Maximum Fruits Harvested After at Most K StepshardArrayBinary SearchSliding WindowPrefix Sumfrequency 7.2
- Maximum Number of BalloonseasyHash TableStringCountingfrequency 7.2
- Maximum Number of Occurrences of a SubstringmediumHash TableStringSliding Windowfrequency 7.2
- Maximum Number of Operations to Move Ones to the EndmediumStringGreedyCountingfrequency 7.2
- Maximum Number of Removable CharactersmediumArrayTwo PointersStringBinary Searchfrequency 7.2
- Maximum Number of Words You Can TypeeasyHash TableStringfrequency 7.2
- Maximum Product of Word LengthsmediumArrayStringBit Manipulationfrequency 7.2
- Maximum Running Time of N ComputershardArrayBinary SearchGreedySortingfrequency 7.2
- Maximum Score After Splitting a StringeasyStringPrefix Sumfrequency 7.2
- Maximum Size Subarray Sum Equals kmediumArrayHash TablePrefix Sumfrequency 7.2
- Maximum Subsequence ScoremediumArrayGreedySortingHeap (Priority Queue)frequency 7.2
- Maximum Value of an Ordered Triplet IImediumArrayPrefix Sumfrequency 7.2
- Maximum Walls Destroyed by RobotshardArrayBinary SearchDynamic ProgrammingSortingfrequency 7.2
- Maximum and Minimum Sums of at Most Size K SubsequencesmediumArrayMathDynamic ProgrammingSorting+1frequency 7.2
- Merge BSTs to Create Single BSThardArrayHash TableTreeDepth-First Search+2frequency 7.2
- Merge In Between Linked ListsmediumLinked Listfrequency 7.2
- Merge Nodes in Between ZerosmediumLinked ListSimulationfrequency 7.2
- Mini ParsermediumStringStackDepth-First Searchfrequency 7.2
- Minimize Malware SpreadhardArrayHash TableDepth-First SearchBreadth-First Search+2frequency 7.2
- Minimize Maximum of ArraymediumArrayBinary SearchDynamic ProgrammingGreedy+1frequency 7.2
- Minimum Absolute Difference in BSTeasyTreeDepth-First SearchBreadth-First SearchBinary Search Tree+1frequency 7.2
- Minimum Adjacent Swaps for K Consecutive OneshardArrayGreedySliding WindowPrefix Sumfrequency 7.2
- Minimum Array EndmediumBit Manipulationfrequency 7.2
- Minimum Bit Flips to Convert NumbereasyBit Manipulationfrequency 7.2
- Minimum Cost to Make at Least One Valid Path in a GridhardArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)+4frequency 7.2
- Minimum Cost to Move Chips to The Same PositioneasyArrayMathGreedyfrequency 7.2
- Minimum Deletions to Make Array DivisiblehardArrayMathSortingHeap (Priority Queue)+3frequency 7.2
- Minimum Deletions to Make String BalancedmediumStringDynamic ProgrammingStackfrequency 7.2
- Minimum Distance Between BST NodeseasyTreeDepth-First SearchBreadth-First SearchBinary Search Tree+1frequency 7.2
- Minimum Edge Reversals So Every Node Is ReachablehardDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph Theoryfrequency 7.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.