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
- Maximum Side Length of a Square with Sum Less than or Equal to ThresholdmediumArrayBinary SearchMatrixPrefix Sumfrequency 24.4
- Merge Two 2D Arrays by Summing ValueseasyArrayHash TableTwo Pointersfrequency 24.4
- Minimize Hamming Distance After Swap OperationsmediumArrayDepth-First SearchUnion-Findfrequency 24.4
- Minimum Depth of Binary TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 24.4
- Minimum Pair Removal to Sort Array IeasyArrayHash TableLinked ListHeap (Priority Queue)+3frequency 24.4
- Minimum Remove to Make Valid ParenthesesmediumStringStackfrequency 24.4
- Number of Ways to Arrive at DestinationmediumDynamic ProgrammingGraph TheoryTopological SortShortest Path+1frequency 24.4
- Palindrome PairshardArrayHash TableStringTrie+1frequency 24.4
- Parallel Courses IIhardDynamic ProgrammingBit ManipulationGraph TheoryBitmask+1frequency 24.4
- Percentage of Users Attended a ContesteasyDatabasefrequency 24.4
- Populating Next Right Pointers in Each NodemediumLinked ListTreeDepth-First SearchBreadth-First Search+1frequency 24.4
- Restore IP AddressesmediumStringBacktrackingfrequency 24.4
- Sort Transformed ArraymediumArrayMathTwo PointersSortingfrequency 24.4
- The k-th Lexicographical String of All Happy Strings of Length nmediumStringBacktrackingfrequency 24.4
- Time Needed to Inform All EmployeesmediumTreeDepth-First SearchBreadth-First Searchfrequency 24.4
- Unique Email AddresseseasyArrayHash TableStringfrequency 24.4
- Valid Mountain ArrayeasyArrayfrequency 24.4
- Words Within Two Edits of DictionarymediumArrayStringTriefrequency 24.4
- X of a Kind in a Deck of CardseasyArrayHash TableMathCounting+3frequency 24.4
- Adjacent Increasing Subarrays Detection IImediumArrayBinary Searchfrequency 23.3
- Bulb SwitchermediumMathBrainteaserfrequency 23.3
- Check If a String Contains All Binary Codes of Size KmediumHash TableStringBit ManipulationRolling Hash+2frequency 23.3
- Check if DFS Strings Are PalindromeshardArrayHash TableStringTree+2frequency 23.3
- Check if Number is a Sum of Powers of ThreemediumMathfrequency 23.3
- Cherry Pickup IIhardArrayDynamic ProgrammingMatrixfrequency 23.3
- Clear DigitseasyStringStackSimulationfrequency 23.3
- Confirmation RatemediumDatabasefrequency 23.3
- Construct Binary Tree from Inorder and Postorder TraversalmediumArrayHash TableDivide and ConquerTree+1frequency 23.3
- Count of Range SumhardArrayBinary SearchDivide and ConquerBinary Indexed Tree+4frequency 23.3
- Count the Number of Fair PairsmediumArrayTwo PointersBinary SearchSortingfrequency 23.3
- Cracking the SafehardStringDepth-First SearchGraph TheoryEulerian Circuit+2frequency 23.3
- Delete Columns to Make SortedeasyArrayStringLongest Increasing Subsequencefrequency 23.3
- Design TwittermediumHash TableLinked ListDesignHeap (Priority Queue)frequency 23.3
- Find Missing ElementseasyArrayHash TableSortingfrequency 23.3
- Find if Path Exists in GrapheasyDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 23.3
- Find the Maximum Length of Valid Subsequence ImediumArrayDynamic Programmingfrequency 23.3
- Find the Maximum Number of Elements in SubsetmediumArrayHash TableEnumerationfrequency 23.3
- Flip Equivalent Binary TreesmediumTreeDepth-First SearchBinary Treefrequency 23.3
- Flip String to Monotone IncreasingmediumStringDynamic Programmingfrequency 23.3
- Furthest Building You Can ReachmediumArrayGreedyHeap (Priority Queue)frequency 23.3
- Game of LifemediumArrayMatrixSimulationfrequency 23.3
- Guess Number Higher or LowereasyBinary SearchInteractivefrequency 23.3
- Hand of StraightsmediumArrayHash TableGreedySortingfrequency 23.3
- House Robber IVmediumArrayBinary SearchDynamic ProgrammingGreedyfrequency 23.3
- Last Day Where You Can Still CrosshardArrayBinary SearchDepth-First SearchBreadth-First Search+2frequency 23.3
- Last Stone WeighteasyArrayHeap (Priority Queue)frequency 23.3
- Longest String ChainmediumArrayHash TableTwo PointersString+2frequency 23.3
- Maximize Distance to Closest PersonmediumArrayfrequency 23.3
- Maximum Matrix SummediumArrayGreedyMatrixfrequency 23.3
- Minimum Cost to Merge StoneshardArrayDynamic ProgrammingPrefix Sumfrequency 23.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.