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 Subarray Sum With Length Divisible by KmediumArrayHash TablePrefix Sumfrequency 14.6
- Maximum Subsequence ScoremediumArrayGreedySortingHeap (Priority Queue)frequency 14.6
- Maximum Units on a TruckeasyArrayGreedySortingfrequency 14.6
- Minimize Maximum Pair Sum in ArraymediumArrayTwo PointersGreedySortingfrequency 14.6
- Minimize the Maximum Edge Weight of GraphmediumBinary SearchDepth-First SearchBreadth-First SearchGraph Theory+1frequency 14.6
- Minimum Equal Sum of Two Arrays After Replacing ZerosmediumArrayGreedyfrequency 14.6
- Minimum Operations to Make Array Sum Divisible by KeasyArrayMathfrequency 14.6
- Minimum Recolors to Get K Consecutive Black BlockseasyStringSliding Windowfrequency 14.6
- Minimum Score of a Path Between Two CitiesmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 14.6
- Minimum Time Visiting All PointseasyArrayMathGeometryfrequency 14.6
- Minimum Time to Complete TripsmediumArrayBinary Searchfrequency 14.6
- Minimum Time to Visit a Cell In a GridhardArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)+2frequency 14.6
- Minimum Value to Get Positive Step by Step SumeasyArrayPrefix Sumfrequency 14.6
- Number of Ways to Split ArraymediumArrayPrefix Sumfrequency 14.6
- Number of ZigZag Arrays IhardDynamic ProgrammingPrefix Sumfrequency 14.6
- Paint House IIIhardArrayDynamic Programmingfrequency 14.6
- Path Existence Queries in a Graph IIhardArrayTwo PointersBinary SearchDynamic Programming+4frequency 14.6
- Populating Next Right Pointers in Each Node IImediumLinked ListTreeDepth-First SearchBreadth-First Search+1frequency 14.6
- Primary Department for Each EmployeeeasyDatabasefrequency 14.6
- Reach a NumbermediumMathBinary Searchfrequency 14.6
- Remove Nodes From Linked ListmediumLinked ListStackRecursionMonotonic Stackfrequency 14.6
- Rotate FunctionmediumArrayMathDynamic Programmingfrequency 14.6
- Satisfiability of Equality EquationsmediumArrayStringUnion-FindGraph Theoryfrequency 14.6
- Shortest Distance to a CharactereasyArrayTwo PointersStringfrequency 14.6
- Shuffle an ArraymediumArrayMathDesignRandomizedfrequency 14.6
- Smallest Even MultipleeasyMathNumber Theoryfrequency 14.6
- Smallest Number With All Set BitseasyMathBit Manipulationfrequency 14.6
- Smallest Palindromic Rearrangement ImediumStringSortingCounting Sortfrequency 14.6
- Sort Array by Increasing FrequencyeasyArrayHash TableSortingfrequency 14.6
- Sorting the SentenceeasyStringSortingBubble Sortfrequency 14.6
- String Matching in an ArrayeasyArrayStringString Matchingfrequency 14.6
- Sum of Left LeaveseasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 14.6
- Sum of k-Mirror NumbershardMathEnumerationfrequency 14.6
- Super PowmediumMathDivide and ConquerEuler's Totient FunctionEuler's Theoremfrequency 14.6
- Take Gifts From the Richest PileeasyArrayHeap (Priority Queue)Simulationfrequency 14.6
- Trips and UsershardDatabasefrequency 14.6
- Walking Robot Simulation IImediumDesignSimulationfrequency 14.6
- XOR Queries of a SubarraymediumArrayBit ManipulationPrefix Sumfrequency 14.6
- Add Two Promiseseasyfrequency 12.6
- Adding Spaces to a StringmediumArrayTwo PointersStringSimulationfrequency 12.6
- Calculate Special BonuseasyDatabasefrequency 12.6
- Check if a Parentheses String Can Be ValidmediumStringStackGreedyBracket Sequencesfrequency 12.6
- Classes With at Least 5 StudentseasyDatabasefrequency 12.6
- Construct String With Repeat LimitmediumHash TableStringGreedyHeap (Priority Queue)+1frequency 12.6
- Contains Duplicate IIIhardArraySliding WindowSortingBucket Sort+1frequency 12.6
- Count Complete Subarrays in an ArraymediumArrayHash TableSliding Windowfrequency 12.6
- Count Covered BuildingsmediumArrayHash TableSortingfrequency 12.6
- Count Elements With Maximum FrequencyeasyArrayHash TableCountingfrequency 12.6
- Count Operations to Obtain ZeroeasyMathSimulationfrequency 12.6
- Count Palindromic SubsequenceshardStringDynamic Programmingfrequency 12.6
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.