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
- Maximum Sum of Three Numbers Divisible by ThreemediumArrayGreedySortingHeap (Priority Queue)frequency 5.0
- Maximum Total Subarray Value IIhardArrayGreedySegment TreeHeap (Priority Queue)frequency 5.0
- Maximum Value after InsertionmediumStringGreedyfrequency 5.0
- Maximum Value of an Ordered Triplet IeasyArrayPrefix Sumfrequency 5.0
- Maximum White Tiles Covered by a CarpetmediumArrayBinary SearchGreedySliding Window+2frequency 5.0
- Maximum XOR After OperationsmediumArrayMathBit Manipulationfrequency 5.0
- Median Employee SalaryhardDatabasefrequency 5.0
- Meeting SchedulermediumArrayTwo PointersSortingfrequency 5.0
- Memoizemediumfrequency 5.0
- Merge Two 2D Arrays by Summing ValueseasyArrayHash TableTwo Pointersfrequency 5.0
- Minimize Deviation in ArrayhardArrayGreedyHeap (Priority Queue)Ordered Setfrequency 5.0
- Minimize Max Distance to Gas StationhardArrayBinary Searchfrequency 5.0
- Minimize the Maximum Adjacent Element DifferencehardArrayBinary SearchGreedyfrequency 5.0
- Minimize the Maximum of Two ArraysmediumMathBinary SearchNumber TheoryLeast Common Multiple+1frequency 5.0
- Minimum Absolute Difference in Sliding SubmatrixmediumArraySortingMatrixfrequency 5.0
- Minimum Addition to Make Integer BeautifulmediumMathGreedyfrequency 5.0
- Minimum Amount of Damage Dealt to BobhardArrayGreedySortingfrequency 5.0
- Minimum Changes To Make Alternating Binary StringeasyStringfrequency 5.0
- Minimum Cost Walk in Weighted GraphhardArrayBit ManipulationUnion-FindGraph Theoryfrequency 5.0
- Minimum Cost to Buy Apples IIhardArrayGraph TheoryHeap (Priority Queue)Shortest Pathfrequency 5.0
- Minimum Cost to Convert String IIhardArrayStringDynamic ProgrammingGraph Theory+2frequency 5.0
- Minimum Cost to Convert String IIIhardfrequency 5.0
- Minimum Cost to Split into OnesmediumMathDynamic Programmingfrequency 5.0
- Minimum Difference Between Largest and Smallest Value in Three MovesmediumArrayGreedySortingfrequency 5.0
- Minimum Distance Between Three Equal Elements IeasyArrayHash Tablefrequency 5.0
- Minimum Distance Between Three Equal Elements IImediumArrayHash Tablefrequency 5.0
- Minimum Division Operations to Make Array Non DecreasingmediumArrayMathGreedyNumber Theoryfrequency 5.0
- Minimum Hours of Training to Win a CompetitioneasyArrayGreedyfrequency 5.0
- Minimum Impossible ORmediumArrayBit ManipulationBrainteaserfrequency 5.0
- Minimum Index of a Valid SplitmediumArrayHash TableSortingfrequency 5.0
- Minimum Insertions to Balance a Parentheses StringmediumStringStackGreedyBracket Sequencesfrequency 5.0
- Minimum Interval to Include Each QueryhardArrayBinary SearchSweep LineSorting+1frequency 5.0
- Minimum Moves to Reach Target ScoremediumMathGreedyfrequency 5.0
- Minimum Moves to Spread Stones Over GridmediumArrayDynamic ProgrammingBacktrackingBit Manipulation+2frequency 5.0
- Minimum Non-Zero Product of the Array ElementsmediumMathGreedyRecursionfrequency 5.0
- Minimum Number of Chairs in a Waiting RoomeasyStringSimulationfrequency 5.0
- Minimum Number of Operations to Make Arrays SimilarhardArrayGreedySortingfrequency 5.0
- Minimum Number of Removals to Make Mountain ArrayhardArrayBinary SearchDynamic ProgrammingGreedyfrequency 5.0
- Minimum Number of Swaps to Make the Binary String AlternatingmediumStringGreedyfrequency 5.0
- Minimum Number of Work Sessions to Finish the TasksmediumArrayDynamic ProgrammingBacktrackingBit Manipulation+1frequency 5.0
- Minimum Operations to Make Array EqualmediumMathfrequency 5.0
- Minimum Operations to Make Array Equal to TargethardArrayDynamic ProgrammingStackGreedy+1frequency 5.0
- Minimum Operations to Write the Letter Y on a GridmediumArrayHash TableMatrixCountingfrequency 5.0
- Minimum Seconds to Equalize a Circular ArraymediumArrayHash Tablefrequency 5.0
- Minimum Subarray Length With Distinct Sum At Least KmediumArrayHash TableSliding Windowfrequency 5.0
- Minimum Suffix FlipsmediumStringGreedyfrequency 5.0
- Minimum Swaps to Make Strings EqualmediumMathStringGreedyfrequency 5.0
- Minimum Time for K Connected ComponentsmediumBinary SearchUnion-FindGraph TheorySortingfrequency 5.0
- Minimum Time to Collect All Apples in a TreemediumHash TableTreeDepth-First SearchBreadth-First Search+1frequency 5.0
- Minimum Time to Visit a Cell In a GridhardArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)+2frequency 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.