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
3,110 questions · all time
- Minimum Operations to Convert NumbermediumArrayBreadth-First Search1 company
- Minimum Time to Remove All Cars Containing Illegal GoodshardStringDynamic Programming1 company
- Number of Beautiful PartitionshardStringDynamic ProgrammingPrefix Sum1 company
- Number of Valid Clock TimeseasyStringEnumeration1 company
- Number of Ways to Reorder Array to Get Same BSThardArrayMathDivide and ConquerDynamic Programming+71 company
- Number of Ways to Stay in the Same Place After Some StepshardDynamic Programming1 company
- Positions of Large GroupseasyString1 company
- Shortest Completing WordeasyArrayHash TableString1 company
- Simplified FractionsmediumMathStringNumber TheoryEuclidean Algorithm+11 company
- Split Array With Minimum DifferencemediumArrayPrefix Sum1 company
- Split Two Strings to Make PalindromemediumTwo PointersString1 company
- Strange Printer IIhardArrayGraph TheoryTopological SortMatrix+11 company
- Sum of Digit Differences of All PairsmediumArrayHash TableMathCounting1 company
- Sum of Imbalance Numbers of All SubarrayshardArrayHash TableEnumeration1 company
- Super PalindromeshardMathStringEnumeration1 company
- Throne InheritancemediumHash TableTreeDepth-First SearchDesign1 company
- Where Will the Ball FallmediumArrayMatrixSimulation1 company
- All Divisions With the Highest Score of a Binary ArraymediumArray1 company
- Ambiguous CoordinatesmediumStringBacktrackingEnumeration1 company
- Array of Doubled PairsmediumArrayHash TableGreedySorting1 company
- Bold Words in StringmediumArrayHash TableStringTrie+21 company
- Booking Concert Tickets in GroupshardBinary SearchDesignBinary Indexed TreeSegment Tree1 company
- Camelcase MatchingmediumArrayTwo PointersStringTrie+11 company
- Campus Bikes IImediumArrayDynamic ProgrammingBacktrackingBit Manipulation+71 company
- Change Minimum Characters to Satisfy One of Three ConditionsmediumHash TableStringCountingPrefix Sum1 company
- Change the Root of a Binary TreemediumTreeDepth-First SearchBinary Tree1 company
- Check If String Is Transformable With Substring Sort OperationshardStringGreedySorting1 company
- Check If Two Expression Trees are EquivalentmediumHash TableTreeDepth-First SearchBinary Tree+11 company
- Check if There Is a Valid Parentheses String PathhardArrayDynamic ProgrammingMatrixBracket Sequences1 company
- Checking Existence of Edge Length Limited Paths IIhardDepth-First SearchUnion-FindGraph TheoryDesign+31 company
- Closest Dessert CostmediumArrayDynamic ProgrammingBacktrackingKnapsack Problem+11 company
- Coin PathhardArrayDynamic Programming1 company
- Compare Strings by Frequency of the Smallest CharactermediumArrayHash TableStringBinary Search+11 company
- Confusing Number IIhardMathBacktracking1 company
- Convex PolygonmediumArrayMathGeometryPolygons1 company
- Correct a Binary TreemediumHash TableTreeDepth-First SearchBreadth-First Search+11 company
- Count Houses in a Circular StreeteasyArrayInteractive1 company
- Count Pairs of Equal Substrings With Minimum DifferencemediumHash TableStringGreedy1 company
- Count Pairs of Points With Distance kmediumArrayHash TableBit Manipulation1 company
- Count Positions on Street With Required BrightnessmediumArrayPrefix Sum1 company
- Count Subarrays With More Ones Than ZerosmediumArrayHash TableBinary SearchDivide and Conquer+41 company
- Count Ways to Distribute CandieshardDynamic Programming1 company
- Count Words Obtained After Adding a LettermediumArrayHash TableStringBit Manipulation+11 company
- Count the Number of Good PartitionshardArrayHash TableMathCombinatorics1 company
- Decrease Elements To Make Array ZigzagmediumArrayGreedy1 company
- Design Most Recently Used QueuemediumArrayLinked ListDivide and ConquerDesign+51 company
- Design Video Sharing PlatformhardHash TableDesignHeap (Priority Queue)1 company
- Design an ATM MachinemediumArrayGreedyDesign1 company
- Determine if a Cell Is Reachable at a Given TimemediumMath1 company
- Divide Array Into Increasing SequenceshardArrayCounting1 company
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.