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
- Boats to Save PeoplemediumArrayTwo PointersGreedySorting+1frequency 28.9
- Delete Nodes From Linked List Present in ArraymediumArrayHash TableLinked Listfrequency 28.9
- Divide Array in Sets of K Consecutive NumbersmediumArrayHash TableGreedySortingfrequency 28.9
- Duplicate ZeroseasyArrayTwo Pointersfrequency 28.9
- Find in Mountain ArrayhardArrayBinary SearchInteractiveTernary Searchfrequency 28.9
- Flatten Nested List IteratormediumStackTreeDepth-First SearchDesign+2frequency 28.9
- Graph Valid TreemediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 28.9
- How Many Numbers Are Smaller Than the Current NumbereasyArrayHash TableSortingCounting Sortfrequency 28.9
- Integer to English WordshardMathStringRecursionfrequency 28.9
- Intersection of Two Arrays IIeasyArrayHash TableTwo PointersBinary Search+1frequency 28.9
- K-th Symbol in GrammarmediumMathBit ManipulationRecursionfrequency 28.9
- Largest Triangle AreaeasyArrayMathGeometryPolygonsfrequency 28.9
- Longest Arithmetic Subsequence of Given DifferencemediumArrayHash TableDynamic Programmingfrequency 28.9
- Longest Non-Decreasing Subarray After Replacing at Most One ElementmediumArrayDynamic Programmingfrequency 28.9
- Longest Palindromic SubsequencemediumStringDynamic Programmingfrequency 28.9
- Maximum Frequency of an Element After Performing Operations ImediumArrayBinary SearchSliding WindowSorting+1frequency 28.9
- Maximum Product of Three NumberseasyArrayMathSortingfrequency 28.9
- Minimum Absolute Difference in BSTeasyTreeDepth-First SearchBreadth-First SearchBinary Search Tree+1frequency 28.9
- Number of Digit OnehardMathDynamic ProgrammingRecursionfrequency 28.9
- Number of Good PairseasyArrayHash TableMathCountingfrequency 28.9
- Remove All Adjacent Duplicates In StringeasyStringStackfrequency 28.9
- Remove Sub-Folders from the FilesystemmediumArrayStringDepth-First SearchTriefrequency 28.9
- Shortest Subarray with Sum at Least KhardArrayBinary SearchQueueSliding Window+3frequency 28.9
- Sliding Window MedianhardArrayHash TableSliding WindowHeap (Priority Queue)+1frequency 28.9
- Sum of Beauty of All SubstringsmediumHash TableStringCountingfrequency 28.9
- Sum of Square NumbersmediumMathTwo PointersBinary Searchfrequency 28.9
- Two Sum IV - Input is a BSTeasyHash TableTwo PointersTreeDepth-First Search+3frequency 28.9
- Valid Parenthesis StringmediumStringDynamic ProgrammingStackGreedy+1frequency 28.9
- Binary Search Tree IteratormediumStackTreeDesignBinary Search Tree+2frequency 28.1
- Count Numbers with Unique DigitsmediumMathDynamic ProgrammingBacktrackingfrequency 28.1
- Design Linked ListmediumLinked ListDesignfrequency 28.1
- Design a Text EditorhardLinked ListStringStackDesign+2frequency 28.1
- Detect CapitaleasyStringfrequency 28.1
- Find Numbers with Even Number of DigitseasyArrayMathfrequency 28.1
- Find the Smallest Divisor Given a ThresholdmediumArrayBinary Searchfrequency 28.1
- House Robber IIImediumDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 28.1
- Interleaving StringmediumStringDynamic Programmingfrequency 28.1
- Is Graph Bipartite?mediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theory+2frequency 28.1
- Island PerimetereasyArrayDepth-First SearchBreadth-First SearchMatrixfrequency 28.1
- Jewels and StoneseasyHash TableStringfrequency 28.1
- K Closest Points to OriginmediumArrayMathDivide and ConquerGeometry+4frequency 28.1
- Kids With the Greatest Number of CandieseasyArrayfrequency 28.1
- Lexicographical NumbersmediumDepth-First SearchTriefrequency 28.1
- Longest Arithmetic SubsequencemediumArrayHash TableBinary SearchDynamic Programmingfrequency 28.1
- Max Chunks To Make SortedmediumArrayStackGreedySorting+1frequency 28.1
- Maximum Beauty of an Array After Applying OperationmediumArrayBinary SearchSliding WindowSortingfrequency 28.1
- Maximum Level Sum of a Binary TreemediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 28.1
- Minimum Domino Rotations For Equal RowmediumArrayGreedyfrequency 28.1
- Minimum Time DifferencemediumArrayMathStringSortingfrequency 28.1
- Nth Highest SalarymediumDatabasefrequency 28.1
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.