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
- Univalued Binary TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Tree3 companies
- Maximum Vacation DayshardArrayDynamic ProgrammingMatrix3 companies
- Debouncemedium3 companies
- Minimum Number of Increments on Subarrays to Form a Target ArrayhardArrayDynamic ProgrammingStackGreedy+13 companies
- Put Boxes Into the Warehouse ImediumArrayGreedySorting3 companies
- Rank Transform of a MatrixhardArrayUnion-FindGraph TheoryTopological Sort+23 companies
- Minimum Cost to Connect SticksmediumArrayGreedyHeap (Priority Queue)3 companies
- Count Nodes Equal to Average of SubtreemediumTreeDepth-First SearchBinary Tree3 companies
- Count Subarrays With Median KhardArrayHash TablePrefix Sum3 companies
- Remove Stones to Minimize the TotalmediumArrayGreedyHeap (Priority Queue)3 companies
- Find Minimum Time to Reach Last Room IImediumArrayGraph TheoryHeap (Priority Queue)Matrix+13 companies
- Find the Number of Ways to Place People IIhardArrayMathGeometrySorting+13 companies
- Find Nearest Point That Has the Same X or Y CoordinateeasyArray3 companies
- Array NestingmediumArrayDepth-First Search3 companies
- Friends Of Appropriate AgesmediumArrayTwo PointersBinary SearchSorting3 companies
- Maximum Subarray Min-ProductmediumArrayStackMonotonic StackPrefix Sum+13 companies
- Valid Arrangement of PairshardArrayDepth-First SearchGraph TheoryEulerian Circuit+23 companies
- Building H2OmediumConcurrency3 companies
- Number of Good Leaf Nodes PairsmediumTreeDepth-First SearchBinary TreeDP on Trees3 companies
- Minimum Sum of Squared DifferencemediumArrayBinary SearchGreedySorting+13 companies
- Random Pick with BlacklisthardArrayHash TableMathBinary Search+23 companies
- Reverse Words in a String IImediumTwo PointersString3 companies
- Minimum Length of String After Deleting Similar EndsmediumTwo PointersString3 companies
- Diagonal Traverse IImediumArraySortingHeap (Priority Queue)3 companies
- Decode the Slanted CiphertextmediumStringSimulation3 companies
- Design Front Middle Back QueuemediumArrayLinked ListDesignQueue+23 companies
- UTF-8 ValidationmediumArrayBit Manipulation3 companies
- Count Different Palindromic SubsequenceshardStringDynamic Programming3 companies
- Minimum Deletions to Make Array DivisiblehardArrayMathSortingHeap (Priority Queue)+33 companies
- Sum of All Odd Length SubarrayseasyArrayMathPrefix Sum3 companies
- Count Number of Trapezoids ImediumArrayHash TableMathGeometry3 companies
- Missing Element in Sorted ArraymediumArrayBinary Search3 companies
- Construct Smallest Number From DI StringmediumStringBacktrackingStackGreedy3 companies
- Count Collisions of Monkeys on a PolygonmediumMathRecursion3 companies
- Count Number of TextsmediumHash TableMathStringDynamic Programming3 companies
- Increment Submatrices by OnemediumArrayMatrixPrefix Sum3 companies
- Split the ArrayeasyArrayHash TableCounting3 companies
- Largest Number After Digit Swaps by ParityeasySortingHeap (Priority Queue)3 companies
- Verify Preorder Sequence in Binary Search TreemediumArrayStackTreeBinary Search Tree+33 companies
- Minimum Time to Collect All Apples in a TreemediumHash TableTreeDepth-First SearchBreadth-First Search+13 companies
- Shortest Path in a Hidden GridmediumArrayDepth-First SearchBreadth-First SearchMatrix+13 companies
- Total Hamming DistancemediumArrayMathBit Manipulation3 companies
- Ways to Make a Fair ArraymediumArrayPrefix Sum3 companies
- Kill ProcessmediumArrayHash TableTreeDepth-First Search+13 companies
- Fizz Buzz MultithreadedmediumConcurrency3 companies
- Linked List Random NodemediumLinked ListMathReservoir SamplingRandomized3 companies
- Diameter of N-Ary TreemediumTreeDepth-First SearchDP on Trees3 companies
- Maximum Path Quality of a GraphhardArrayBacktrackingGraph Theory3 companies
- Monotonic ArrayeasyArray3 companies
- Merge Nodes in Between ZerosmediumLinked ListSimulation3 companies
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.