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
1,399 questions at Meta · all time
- Maximum Product of Three Elements After One ReplacementmediumArrayMathGreedySortingfrequency 5.0
- Maximum Product of Two DigitseasyMathSortingfrequency 5.0
- Maximum Profit from Trading Stocks with DiscountshardArrayDynamic ProgrammingTreeDepth-First Searchfrequency 5.0
- Maximum Score From Removing SubstringsmediumStringStackGreedyfrequency 5.0
- Maximum Subarray Sum with One DeletionmediumArrayDynamic Programmingfrequency 5.0
- Maximum Total Damage With Spell CastingmediumArrayHash TableTwo PointersBinary Search+3frequency 5.0
- Maximum Twin Sum of a Linked ListmediumLinked ListTwo PointersStackfrequency 5.0
- Maximum Vacation DayshardArrayDynamic ProgrammingMatrixfrequency 5.0
- Maximum Value at a Given Index in a Bounded ArraymediumMathBinary SearchGreedyfrequency 5.0
- Maximum Value of an Ordered Triplet IeasyArrayPrefix Sumfrequency 5.0
- Maximum and Minimum Sums of at Most Size K SubsequencesmediumArrayMathDynamic ProgrammingSorting+1frequency 5.0
- Minimized Maximum of Products Distributed to Any StoremediumArrayBinary SearchGreedyfrequency 5.0
- Minimum ASCII Delete Sum for Two StringsmediumStringDynamic ProgrammingLongest Common Subsequencefrequency 5.0
- Minimum Addition to Make Integer BeautifulmediumMathGreedyfrequency 5.0
- Minimum Adjacent Swaps to Reach the Kth Smallest NumbermediumTwo PointersStringGreedyfrequency 5.0
- Minimum Area RectanglemediumArrayHash TableMathGeometry+1frequency 5.0
- Minimum Average DifferencemediumArrayPrefix Sumfrequency 5.0
- Minimum Cost Path with Alternating Directions IIIhardfrequency 5.0
- Minimum Cost to Cut a StickhardArrayDynamic ProgrammingSortingfrequency 5.0
- Minimum Difference Between Highest and Lowest of K ScoreseasyArraySliding WindowSortingfrequency 5.0
- Minimum Domino Rotations For Equal RowmediumArrayGreedyfrequency 5.0
- Minimum Falling Path Sum IIhardArrayDynamic ProgrammingMatrixfrequency 5.0
- Minimum Fuel Cost to Report to the CapitalmediumTreeDepth-First SearchBreadth-First SearchGraph Theoryfrequency 5.0
- Minimum Jumps to Reach End via Prime TeleportationmediumArrayHash TableMathBreadth-First Search+1frequency 5.0
- Minimum Length of String After Deleting Similar EndsmediumTwo PointersStringfrequency 5.0
- Minimum Moves to Reach Target ScoremediumMathGreedyfrequency 5.0
- Minimum Number of Coins to be AddedmediumArrayGreedySortingfrequency 5.0
- Minimum Number of K Consecutive Bit FlipshardArrayBit ManipulationQueueSliding Window+2frequency 5.0
- Minimum Number of Moves to Seat EveryoneeasyArrayGreedySortingCounting Sortfrequency 5.0
- Minimum Number of Operations to Make Array EmptymediumArrayHash TableGreedyCountingfrequency 5.0
- Minimum Number of Operations to Make Elements in Array DistincteasyArrayHash Tablefrequency 5.0
- Minimum Number of Removals to Make Mountain ArrayhardArrayBinary SearchDynamic ProgrammingGreedyfrequency 5.0
- Minimum Number of Seconds to Make Mountain Height ZeromediumArrayMathBinary SearchGreedy+1frequency 5.0
- Minimum Number of Swaps to Make the String BalancedmediumTwo PointersStringStackGreedy+1frequency 5.0
- Minimum Number of Taps to Open to Water a GardenhardArrayDynamic ProgrammingGreedyfrequency 5.0
- Minimum Operations to Convert All Elements to ZeromediumArrayHash TableStackGreedy+1frequency 5.0
- Minimum Operations to Make Array Elements ZerohardArrayMathBit Manipulationfrequency 5.0
- Minimum Operations to Make a Uni-Value GridmediumArrayMathSortingMatrixfrequency 5.0
- Minimum Penalty for a ShopmediumStringPrefix Sumfrequency 5.0
- Minimum Recolors to Get K Consecutive Black BlockseasyStringSliding Windowfrequency 5.0
- Minimum Score After Removals on a TreehardArrayBit ManipulationTreeDepth-First Searchfrequency 5.0
- Minimum Value to Get Positive Step by Step SumeasyArrayPrefix Sumfrequency 5.0
- Most Profit Assigning WorkmediumArrayTwo PointersBinary SearchGreedy+1frequency 5.0
- Most Profitable Path in a TreemediumArrayTreeDepth-First SearchBreadth-First Search+1frequency 5.0
- N-Repeated Element in Size 2N ArrayeasyArrayHash TablePigeonhole Principlefrequency 5.0
- Next Greater Element IVhardArrayBinary SearchStackSorting+2frequency 5.0
- Next Greater Numerically Balanced NumbermediumHash TableMathBacktrackingCounting+1frequency 5.0
- Non-decreasing ArraymediumArrayfrequency 5.0
- Number ComplementeasyBit Manipulationfrequency 5.0
- Number of Adjacent Elements With the Same ColormediumArrayfrequency 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.