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
- Minimum Knight MovesmediumBreadth-First SearchHeuristic SearchBidirectional SearchA* Searchfrequency 23.3
- Minimum Obstacle Removal to Reach CornerhardArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)+4frequency 23.3
- Number of Flowers in Full BloomhardArrayHash TableBinary SearchSorting+2frequency 23.3
- Palindrome Partitioning IIhardStringDynamic Programmingfrequency 23.3
- Push DominoesmediumTwo PointersStringDynamic Programmingfrequency 23.3
- Pyramid Transition MatrixmediumHash TableStringBacktrackingBit Manipulationfrequency 23.3
- Range Sum Query 2D - MutablemediumArrayDesignBinary Indexed TreeSegment Tree+2frequency 23.3
- Remove All Occurrences of a SubstringmediumStringStackSimulationfrequency 23.3
- Reschedule Meetings for Maximum Free Time IImediumArrayGreedyEnumerationfrequency 23.3
- Smallest Range Covering Elements from K ListshardArrayHash TableGreedySliding Window+2frequency 23.3
- Smallest String Starting From LeafmediumStringBacktrackingTreeDepth-First Search+1frequency 23.3
- Sort Integers by The Power ValuemediumDynamic ProgrammingMemoizationSortingfrequency 23.3
- Special Positions in a Binary MatrixeasyArrayMatrixfrequency 23.3
- The Earliest and Latest Rounds Where Players CompetehardDynamic ProgrammingMemoizationfrequency 23.3
- Tiling a Rectangle with the Fewest SquareshardBacktrackingfrequency 23.3
- Two Best Non-Overlapping EventsmediumArrayBinary SearchDynamic ProgrammingSorting+1frequency 23.3
- Unique Binary Search TreesmediumMathDynamic ProgrammingTreeBinary Search Tree+1frequency 23.3
- Unique Binary Search Trees IImediumDynamic ProgrammingBacktrackingTreeBinary Search Tree+1frequency 23.3
- Word SubsetsmediumArrayHash TableStringfrequency 23.3
- Arithmetic SubarraysmediumArrayHash TableSortingfrequency 22.1
- Beautiful ArraymediumArrayMathDivide and Conquerfrequency 22.1
- Cat and MousehardMathDynamic ProgrammingGraph TheoryTopological Sort+4frequency 22.1
- Check if There is a Path With Equal Number of 0's And 1'smediumArrayDynamic ProgrammingMatrixfrequency 22.1
- Checking Existence of Edge Length Limited PathshardArrayTwo PointersUnion-FindGraph Theory+1frequency 22.1
- Convert Object to JSON Stringmediumfrequency 22.1
- Corporate Flight BookingsmediumArrayPrefix Sumfrequency 22.1
- Critical Connections in a NetworkhardDepth-First SearchGraph TheoryBiconnected ComponentBridge (Graph)frequency 22.1
- Delete Columns to Make Sorted IImediumArrayStringGreedyfrequency 22.1
- Design Task ManagermediumHash TableDesignHeap (Priority Queue)Ordered Setfrequency 22.1
- Divide an Array Into Subarrays With Minimum Cost IeasyArraySortingEnumerationfrequency 22.1
- Employee Free TimehardArraySweep LineSortingHeap (Priority Queue)frequency 22.1
- Escape The GhostsmediumArrayMathfrequency 22.1
- Factorial Trailing ZeroesmediumMathfrequency 22.1
- Filling Bookcase ShelvesmediumArrayDynamic Programmingfrequency 22.1
- Final Value of Variable After Performing OperationseasyArrayStringSimulationfrequency 22.1
- Find the K-th Character in String Game IeasyMathBit ManipulationRecursionSimulationfrequency 22.1
- Find the Punishment Number of an IntegermediumMathBacktrackingfrequency 22.1
- Finding 3-Digit Even NumberseasyArrayHash TableRecursionSorting+1frequency 22.1
- Frog Jump IImediumArrayBinary SearchGreedyfrequency 22.1
- Fruits Into Baskets IIeasyArrayBinary SearchSegment TreeSimulation+1frequency 22.1
- Implement Magic DictionarymediumHash TableStringDepth-First SearchDesign+1frequency 22.1
- Insert into a Sorted Circular Linked ListmediumLinked Listfrequency 22.1
- Integer ReplacementmediumDynamic ProgrammingGreedyBit ManipulationMemoizationfrequency 22.1
- Jump Game IVhardArrayHash TableBreadth-First Searchfrequency 22.1
- Jump Game VIImediumStringDynamic ProgrammingSliding WindowPrefix Sumfrequency 22.1
- Largest Component Size by Common FactorhardArrayHash TableMathUnion-Find+2frequency 22.1
- Largest Odd Number in StringeasyMathStringGreedyfrequency 22.1
- Longest Balanced Subarray IIhardArrayHash TableDivide and ConquerSegment Tree+1frequency 22.1
- Longest Palindromic Subsequence After at Most K OperationsmediumStringDynamic Programmingfrequency 22.1
- Longest Substring with At Least K Repeating CharactersmediumHash TableStringDivide and ConquerSliding Windowfrequency 22.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.