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
- First and Last Call On the Same DayhardDatabase1 company
- Frequency Balance Subarraymedium1 company
- Game Play Analysis IIeasyDatabase1 company
- Generate Random Point in a CirclemediumMathGeometryRejection SamplingRandomized1 company
- Good Subsequence QuerieshardArrayMathSegment TreeNumber Theory1 company
- Implement Trie II (Prefix Tree)mediumHash TableStringDesignTrie1 company
- Increasing Decreasing StringeasyHash TableStringCounting1 company
- Is Object Emptyeasy1 company
- K-Concatenation Maximum SummediumArrayDynamic Programming1 company
- K-th Nearest Obstacle QueriesmediumArrayHeap (Priority Queue)1 company
- Kth Smallest InstructionshardArrayMathDynamic ProgrammingCombinatorics1 company
- Largest Palindrome ProducthardMathEnumeration1 company
- Lexicographically Smallest String After Deleting Duplicate CharactershardHash TableStringStackGreedy+11 company
- Limit Occurrences in Sorted ArrayeasyArrayTwo Pointers1 company
- Longest Balanced Substring After One SwapmediumHash TableStringPrefix Sum1 company
- Longest Common Prefix Between Adjacent Strings After RemovalsmediumArrayString1 company
- Longest Palindrome After Substring Concatenation IIhardTwo PointersStringDynamic Programming1 company
- Longest Palindromic Path in GraphhardStringDynamic ProgrammingBit ManipulationGraph Theory+11 company
- Longest Subsequence With Decreasing Adjacent DifferencemediumArrayDynamic Programming1 company
- Longest Unequal Adjacent Groups Subsequence IImediumArrayStringDynamic Programming1 company
- Longest Well-Performing IntervalmediumArrayHash TableStackMonotonic Stack+11 company
- Lucky Numbers in a MatrixeasyArrayMatrix1 company
- Make Array EmptyhardArrayBinary SearchGreedyBinary Indexed Tree+31 company
- Make K-Subarray Sums EqualmediumArrayMathGreedySorting+11 company
- Map Sum PairsmediumHash TableStringDesignTrie1 company
- Market Analysis IIhardDatabase1 company
- Maximize Count of Distinct Primes After SplithardArrayHash TableMathSegment Tree+21 company
- Maximize Sum of Squares of DigitsmediumMathGreedy1 company
- Maximum Area of a Piece of Cake After Horizontal and Vertical CutsmediumArrayGreedySorting1 company
- Maximum Containers on a ShipeasyMath1 company
- Maximum Number of Moves to Kill All PawnshardArrayMathBit ManipulationBreadth-First Search+21 company
- Maximum Number of Weeks for Which You Can WorkmediumArrayGreedy1 company
- Maximum Partition FactorhardArrayBinary SearchDepth-First SearchBreadth-First Search+21 company
- Maximum Product After K IncrementsmediumArrayGreedyHeap (Priority Queue)1 company
- Maximum Product of First and Last Elements of a SubsequencemediumArrayTwo Pointers1 company
- Maximum Score of Non-overlapping IntervalshardArrayBinary SearchDynamic ProgrammingSorting1 company
- Maximum Substrings With Distinct StartmediumHash TableString1 company
- Maximum Sum Obtained of Any PermutationmediumArrayGreedySortingPrefix Sum1 company
- Maximum Sum of Three Numbers Divisible by ThreemediumArrayGreedySortingHeap (Priority Queue)1 company
- Maximum Value after InsertionmediumStringGreedy1 company
- Maximum Value of a String in an ArrayeasyArrayString1 company
- Maximum XOR After OperationsmediumArrayMathBit Manipulation1 company
- Memoize IIhard1 company
- Merge Operations for Minimum Travel TimehardArrayDynamic ProgrammingPrefix Sum1 company
- Minimize Deviation in ArrayhardArrayGreedyHeap (Priority Queue)Ordered Set1 company
- Minimize the Maximum Adjacent Element DifferencehardArrayBinary SearchGreedy1 company
- Minimize the Maximum of Two ArraysmediumMathBinary SearchNumber TheoryLeast Common Multiple+11 company
- Minimum Amount of Damage Dealt to BobhardArrayGreedySorting1 company
- Minimum Amount of Time to Fill CupseasyArrayGreedySortingHeap (Priority Queue)1 company
- Minimum Cost Path with Alternating Directions IIIhard1 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.