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
- Largest Rectangle in HistogramhardArrayStackMonotonic StackRange Minimum/Maximum Queryfrequency 57.0
- Rotate ArraymediumArrayMathTwo Pointersfrequency 56.6
- Find Peak ElementmediumArrayBinary Searchfrequency 56.5
- Minimum Number of Increments on Subarrays to Form a Target ArrayhardArrayDynamic ProgrammingStackGreedy+1frequency 56.5
- Group AnagramsmediumArrayHash TableStringSortingfrequency 56.2
- Rotate ImagemediumArrayMathMatrixfrequency 56.2
- Plus OneeasyArrayMathfrequency 55.3
- Combine Two TableseasyDatabasefrequency 55.1
- Find the Index of the First Occurrence in a StringeasyTwo PointersStringString MatchingZ Algorithm+2frequency 55.1
- Happy NumbereasyHash TableMathTwo PointersFloyd's Cycle Finding Algorithmfrequency 54.9
- Kth Largest Element in an ArraymediumArrayDivide and ConquerSortingHeap (Priority Queue)+1frequency 54.8
- Search Insert PositioneasyArrayBinary Searchfrequency 54.8
- Max Consecutive OneseasyArrayfrequency 54.5
- Sliding Window MaximumhardArrayQueueSliding WindowHeap (Priority Queue)+2frequency 54.5
- Viewers Turned StreamershardDatabasefrequency 54.5
- Pow(x, n)mediumMathRecursionfrequency 54.2
- Longest Repeating Character ReplacementmediumHash TableStringSliding Windowfrequency 53.8
- Single Element in a Sorted ArraymediumArrayBinary Searchfrequency 53.8
- Zigzag ConversionmediumStringfrequency 53.8
- Product of Array Except SelfmediumArrayPrefix Sumfrequency 53.7
- Add BinaryeasyMathStringBit ManipulationSimulationfrequency 53.4
- Power of TwoeasyMathBit ManipulationRecursionfrequency 53.4
- Sort ColorsmediumArrayTwo PointersSortingQuicksort+1frequency 53.2
- Number of Visible People in a QueuehardArrayStackMonotonic Stackfrequency 52.9
- Russian Doll EnvelopeshardArrayBinary SearchDynamic ProgrammingSorting+1frequency 52.7
- Longest Increasing SubsequencemediumArrayBinary SearchDynamic ProgrammingLongest Increasing Subsequencefrequency 52.5
- Contains DuplicateeasyArrayHash TableSortingfrequency 52.3
- Logger Rate LimitereasyHash TableDesignData Streamfrequency 52.3
- Valid PalindromeeasyTwo PointersStringfrequency 52.3
- Find First and Last Position of Element in Sorted ArraymediumArrayBinary Searchfrequency 52.2
- Regular Expression MatchinghardStringDynamic ProgrammingRecursionfrequency 52.2
- Rotting OrangesmediumArrayBreadth-First SearchMatrixfrequency 52.0
- Sqrt(x)easyMathBinary SearchNewton's Methodfrequency 52.0
- Binary SearcheasyArrayBinary Searchfrequency 51.8
- Course SchedulemediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+1frequency 51.8
- Maximal SquaremediumArrayDynamic ProgrammingMatrixfrequency 51.4
- Set Matrix ZeroesmediumArrayHash TableMatrixfrequency 51.4
- Find Median from Data StreamhardTwo PointersDesignSortingHeap (Priority Queue)+1frequency 51.3
- SubsetsmediumArrayBacktrackingBit Manipulationfrequency 51.3
- Maximal RectanglehardArrayDynamic ProgrammingStackMatrix+1frequency 51.1
- Maximum Product SubarraymediumArrayDynamic Programmingfrequency 51.1
- Intersection of Two ArrayseasyArrayHash TableTwo PointersBinary Search+1frequency 50.9
- Basic CalculatorhardMathStringStackRecursionfrequency 50.5
- Remove Nth Node From End of ListmediumLinked ListTwo Pointersfrequency 50.5
- 3Sum ClosestmediumArrayTwo PointersSortingfrequency 50.3
- Fruit Into BasketsmediumArrayHash TableSliding Windowfrequency 50.1
- Min StackmediumStackDesignfrequency 50.1
- PermutationsmediumArrayBacktrackingfrequency 49.7
- Merge k Sorted ListshardLinked ListDivide and ConquerHeap (Priority Queue)Merge Sort+1frequency 49.5
- Palindrome Linked ListeasyLinked ListTwo PointersStackRecursionfrequency 49.5
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.