Problems
Callback's own problems and the LeetCode questions companies have been asking, in one place — pick a category, then filter by company, frequency, status, difficulty, topic, and language.
Asked on LeetCode
3,115 questions · all time
- Duplicate ZeroseasyArrayTwo Pointers4 companies
- Maximum Frequency of an Element After Performing Operations ImediumArrayBinary SearchSliding WindowSorting+14 companies
- Detect CapitaleasyString4 companies
- Maximum Level Sum of a Binary TreemediumTreeDepth-First SearchBreadth-First SearchBinary Tree4 companies
- Minimum Domino Rotations For Equal RowmediumArrayGreedy4 companies
- Wiggle Sort IImediumArrayDivide and ConquerGreedySorting+14 companies
- Combination Sum IIImediumArrayBacktracking4 companies
- Department Highest SalarymediumDatabase4 companies
- Minimum Jumps to Reach End via Prime TeleportationmediumArrayHash TableMathBreadth-First Search+14 companies
- The Number of the Smallest Unoccupied ChairmediumArrayHash TableHeap (Priority Queue)4 companies
- Minimum Array SummediumArrayDynamic Programming4 companies
- Largest Positive Integer That Exists With Its NegativeeasyArrayHash TableTwo PointersSorting4 companies
- Maximum Binary TreemediumArrayDivide and ConquerStackTree+34 companies
- Single Number IIImediumArrayBit Manipulation4 companies
- Three DivisorseasyMathEnumerationNumber TheoryPrime Factorization+14 companies
- Kth Ancestor of a Tree NodehardBinary SearchDynamic ProgrammingBit ManipulationTree+44 companies
- Reschedule Meetings for Maximum Free Time ImediumArrayGreedySliding Window4 companies
- Brick WallmediumArrayHash Table4 companies
- Longest Continuous Increasing SubsequenceeasyArray4 companies
- Sum of Unique ElementseasyArrayHash TableCounting4 companies
- Actors and Directors Who Cooperated At Least Three TimeseasyDatabase4 companies
- Check If Digits Are Equal in String After Operations IeasyMathStringSimulationCombinatorics+14 companies
- Determine Whether Matrix Can Be Obtained By RotationeasyArrayMatrix4 companies
- Maximum Element After Decreasing and RearrangingmediumArrayGreedySorting4 companies
- Adjacent Increasing Subarrays Detection IeasyArray4 companies
- Convert 1D Array Into 2D ArrayeasyArrayMatrixSimulation4 companies
- Count Submatrices With All OnesmediumArrayDynamic ProgrammingStackMatrix+14 companies
- Longest Absolute File PathmediumStringStackDepth-First Search4 companies
- Maximum Number of Distinct Elements After OperationsmediumArrayGreedySorting4 companies
- Build an Array With Stack OperationsmediumArrayStackSimulation4 companies
- Count Number of Bad PairsmediumArrayHash TableMathCounting4 companies
- Find All K-Distant Indices in an ArrayeasyArrayTwo Pointers4 companies
- Find Mode in Binary Search TreeeasyTreeDepth-First SearchBinary Search TreeBinary Tree4 companies
- Minimum Number of Flips to Make the Binary String AlternatingmediumStringDynamic ProgrammingSliding Window4 companies
- Path with Maximum ProbabilitymediumArrayGraph TheoryHeap (Priority Queue)Shortest Path+14 companies
- Special Array IeasyArray4 companies
- Average of Levels in Binary TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Tree4 companies
- Convert BST to Greater TreemediumTreeDepth-First SearchBinary Search TreeBinary Tree4 companies
- Maximum Ice Cream BarsmediumArrayGreedySortingCounting Sort4 companies
- Reformat Department TableeasyDatabase4 companies
- Serialize and Deserialize BSTmediumStringTreeDepth-First SearchBreadth-First Search+34 companies
- Sum of Root To Leaf Binary NumberseasyTreeDepth-First SearchBinary Tree4 companies
- Maximum Ascending Subarray SumeasyArray4 companies
- Arithmetic SlicesmediumArrayDynamic ProgrammingSliding Window4 companies
- As Far from Land as PossiblemediumArrayDynamic ProgrammingBreadth-First SearchMatrix4 companies
- Best Sightseeing PairmediumArrayDynamic Programming4 companies
- Maximal Score After Applying K OperationsmediumArrayGreedyHeap (Priority Queue)4 companies
- Minimum Operations to Make the Array IncreasingeasyArrayGreedy4 companies
- Next Greater Numerically Balanced NumbermediumHash TableMathBacktrackingCounting+14 companies
- Counting Words With a Given PrefixeasyArrayStringString Matching4 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.