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
- Lowest Common Ancestor of a Binary Tree IVmediumHash TableTreeDepth-First SearchBinary Tree+24 companies
- Minimize Maximum Component CostmediumBinary SearchUnion-FindGraph TheorySorting4 companies
- Goat LatineasyString4 companies
- Stream of CharactershardArrayStringDesignTrie+24 companies
- Split a String in Balanced StringseasyStringGreedyCounting4 companies
- Lexicographically Smallest Generated StringhardStringGreedyString Matching4 companies
- Make Lexicographically Smallest Array by Swapping ElementsmediumArrayUnion-FindSorting4 companies
- Minimum Cost to Convert String IIhardArrayStringDynamic ProgrammingGraph Theory+24 companies
- Minimum Time to Visit a Cell In a GridhardArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)+24 companies
- Random Pick IndexmediumHash TableMathReservoir SamplingRandomized4 companies
- Delete Nodes And Return ForestmediumArrayHash TableTreeDepth-First Search+14 companies
- Identify the Largest Outlier in an ArraymediumArrayHash TableCountingEnumeration4 companies
- Two City SchedulingmediumArrayGreedySortingHungarian Algorithm+14 companies
- Maximum Earnings From TaximediumArrayHash TableBinary SearchDynamic Programming+14 companies
- Decrypt String from Alphabet to Integer MappingeasyString4 companies
- Last Substring in Lexicographical OrderhardTwo PointersStringLyndon Factorization4 companies
- Distribute Candies Among Children IImediumMathCombinatoricsEnumeration4 companies
- Count Integers in IntervalshardDesignSegment TreeOrdered Set4 companies
- Find the Minimum Area to Cover All Ones IIhardArrayMatrixEnumeration4 companies
- Minimum Removals to Balance ArraymediumArrayBinary SearchSliding WindowSorting4 companies
- Number of Submatrices That Sum to TargethardArrayHash TableMatrixPrefix Sum4 companies
- Check Completeness of a Binary TreemediumTreeBreadth-First SearchBinary Tree4 companies
- Count Complete Subarrays in an ArraymediumArrayHash TableSliding Window4 companies
- Minimum Time to Complete TripsmediumArrayBinary Search4 companies
- Knight Probability in ChessboardmediumDynamic Programming4 companies
- Count Nodes Equal to Average of SubtreemediumTreeDepth-First SearchBinary Tree4 companies
- K-diff Pairs in an ArraymediumArrayHash TableTwo PointersBinary Search+14 companies
- Replace WordsmediumArrayHash TableStringTrie4 companies
- Number of Flowers in Full BloomhardArrayHash TableBinary SearchSorting+24 companies
- Lowest Common Ancestor of a Binary Tree IImediumTreeDepth-First SearchBinary TreeBinary Lifting+14 companies
- Regions Cut By SlashesmediumArrayHash TableDepth-First SearchBreadth-First Search+34 companies
- Largest Local Values in a MatrixeasyArrayMatrix4 companies
- Maximum Frequency After Subarray OperationmediumArrayHash TableDynamic ProgrammingGreedy+24 companies
- Battleships in a BoardmediumArrayDepth-First SearchMatrix4 companies
- Best Time to Buy and Sell Stock using StrategymediumArraySliding WindowPrefix Sum4 companies
- Find the City With the Smallest Number of Neighbors at a Threshold DistancemediumDynamic ProgrammingGraph TheoryShortest PathDijkstra's Algorithm+24 companies
- Find the Distance Value Between Two ArrayseasyArrayTwo PointersBinary SearchSorting4 companies
- Zero Array Transformation ImediumArrayPrefix Sum4 companies
- Longest Substring Of All Vowels in OrdermediumStringSliding Window4 companies
- Sentence Similarity IImediumArrayHash TableStringDepth-First Search+24 companies
- Separate Squares ImediumArrayBinary Search4 companies
- Find Triangular Sum of an ArraymediumArrayMathSimulationCombinatorics+14 companies
- Minimum Cost to Merge StoneshardArrayDynamic ProgrammingPrefix Sum4 companies
- Number of Dice Rolls With Target SummediumDynamic Programming4 companies
- Range Product Queries of PowersmediumArrayBit ManipulationPrefix Sum4 companies
- Length of Longest V-Shaped Diagonal SegmenthardArrayDynamic ProgrammingMemoizationMatrix4 companies
- Minimum Number of Moves to Make PalindromehardTwo PointersStringGreedyBinary Indexed Tree4 companies
- Minimum Number of Pushes to Type Word IeasyMathStringGreedy4 companies
- Binary Tree Longest Consecutive SequencemediumTreeDepth-First SearchBinary TreeDP on Trees4 companies
- Numbers At Most N Given Digit SethardArrayMathStringBinary Search+14 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.