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
2,344 questions at Google · all time
- Number of Recent CallseasyDesignQueueData Streamfrequency 28.1
- Pascal's Triangle IIeasyArrayDynamic Programmingfrequency 28.1
- Product of the Last K NumbersmediumArrayMathDesignData Stream+1frequency 28.1
- Queue Reconstruction by HeightmediumArrayBinary Indexed TreeSegment TreeSortingfrequency 28.1
- Rank ScoresmediumDatabasefrequency 28.1
- Sender With Largest Word CountmediumArrayHash TableStringCountingfrequency 28.1
- Smallest Subsequence of Distinct CharactersmediumStringStackGreedyMonotonic Stackfrequency 28.1
- Snakes and LaddersmediumArrayBreadth-First SearchMatrixfrequency 28.1
- Spiral Matrix IImediumArrayMatrixSimulationfrequency 28.1
- Sum of Good SubsequenceshardArrayHash TableDynamic Programmingfrequency 28.1
- Water BottleseasyMathSimulationfrequency 28.1
- Wiggle Sort IImediumArrayDivide and ConquerGreedySorting+1frequency 28.1
- Zero Array Transformation IIImediumArrayTwo PointersGreedySorting+2frequency 28.1
- Binary Tree Preorder TraversaleasyStackTreeDepth-First SearchBinary Treefrequency 27.2
- Check if Grid can be Cut into SectionsmediumArraySortingfrequency 27.2
- Count Complete Tree NodesmediumBinary SearchBit ManipulationTreeBinary Treefrequency 27.2
- Delete the Middle Node of a Linked ListmediumLinked ListTwo Pointersfrequency 27.2
- Kth Ancestor of a Tree NodehardBinary SearchDynamic ProgrammingBit ManipulationTree+4frequency 27.2
- Longest Harmonious SubsequenceeasyArrayHash TableSliding WindowSorting+1frequency 27.2
- Longest Subarray of 1's After Deleting One ElementmediumArrayDynamic ProgrammingSliding Windowfrequency 27.2
- Lowest Common Ancestor of a Binary Search TreemediumTreeDepth-First SearchBinary Search TreeBinary Tree+2frequency 27.2
- Maximum Score From Removing SubstringsmediumStringStackGreedyfrequency 27.2
- Minimum Difference Between Largest and Smallest Value in Three MovesmediumArrayGreedySortingfrequency 27.2
- Minimum Operations to Reduce X to ZeromediumArrayHash TableBinary SearchSliding Window+1frequency 27.2
- My Calendar ImediumArrayBinary SearchDesignSegment Tree+1frequency 27.2
- Number of EnclavesmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 27.2
- Number of Subsequences That Satisfy the Given Sum ConditionmediumArrayTwo PointersBinary SearchSortingfrequency 27.2
- Painting a Grid With Three Different ColorshardDynamic ProgrammingGraph Coloringfrequency 27.2
- Product Price at a Given DatemediumDatabasefrequency 27.2
- Reschedule Meetings for Maximum Free Time ImediumArrayGreedySliding Windowfrequency 27.2
- Robot Return to OrigineasyStringSimulationfrequency 27.2
- Rotated DigitsmediumMathDynamic Programmingfrequency 27.2
- Smallest Integer Divisible by KmediumHash TableMathPigeonhole Principlefrequency 27.2
- Sum Root to Leaf NumbersmediumTreeDepth-First SearchBinary Treefrequency 27.2
- The kth Factor of nmediumMathNumber TheoryPrime Factorizationfrequency 27.2
- To Be Or Not To Beeasyfrequency 27.2
- Valid Perfect SquareeasyMathBinary Searchfrequency 27.2
- 132 PatternmediumArrayBinary SearchStackMonotonic Stack+1frequency 26.3
- Adjacent Increasing Subarrays Detection IeasyArrayfrequency 26.3
- All O`one Data StructurehardHash TableLinked ListDesignDoubly-Linked Listfrequency 26.3
- Bag of TokensmediumArrayTwo PointersGreedySortingfrequency 26.3
- Best Time to Buy and Sell Stock IVhardArrayDynamic Programmingfrequency 26.3
- Check if Word Can Be Placed In CrosswordmediumArrayMatrixEnumerationfrequency 26.3
- Convert 1D Array Into 2D ArrayeasyArrayMatrixSimulationfrequency 26.3
- Count Number of Nice SubarraysmediumArrayHash TableMathSliding Window+1frequency 26.3
- Count Special SubsequencesmediumArrayHash TableMathEnumerationfrequency 26.3
- Count Submatrices With All OnesmediumArrayDynamic ProgrammingStackMatrix+1frequency 26.3
- Delete Duplicate EmailseasyDatabasefrequency 26.3
- Design Search Autocomplete SystemhardStringDepth-First SearchDesignTrie+3frequency 26.3
- Divide Array Into Arrays With Max DifferencemediumArrayGreedySortingfrequency 26.3
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.