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 Length of a Concatenated String with Unique CharactersmediumArrayStringBacktrackingBit Manipulationfrequency 5.0
- Maximum Number of BalloonseasyHash TableStringCountingfrequency 5.0
- Maximum Number of Fish in a GridmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 5.0
- Maximum Number of Moves to Kill All PawnshardArrayMathBit ManipulationBreadth-First Search+2frequency 5.0
- Maximum Number of Occurrences of a SubstringmediumHash TableStringSliding Windowfrequency 5.0
- Maximum Partition FactorhardArrayBinary SearchDepth-First SearchBreadth-First Search+2frequency 5.0
- Maximum Path Quality of a GraphhardArrayBacktrackingGraph Theoryfrequency 5.0
- Maximum Product After K IncrementsmediumArrayGreedyHeap (Priority Queue)frequency 5.0
- Maximum Product of Three Elements After One ReplacementmediumArrayMathGreedySortingfrequency 5.0
- Maximum Size Subarray Sum Equals kmediumArrayHash TablePrefix Sumfrequency 5.0
- Maximum Star Sum of a GraphmediumArrayGreedyGraph TheorySorting+1frequency 5.0
- Maximum Subarray Sum After MultipliermediumArrayDynamic Programmingfrequency 5.0
- Maximum Sum Obtained of Any PermutationmediumArrayGreedySortingPrefix Sumfrequency 5.0
- Maximum Sum of Two Non-Overlapping SubarraysmediumArrayDynamic ProgrammingSliding Windowfrequency 5.0
- Maximum Total Subarray Value IIhardArrayGreedySegment TreeHeap (Priority Queue)frequency 5.0
- Maximum Total from Optimal Activation OrdermediumArrayTwo PointersGreedySorting+1frequency 5.0
- Maximum Value of a String in an ArrayeasyArrayStringfrequency 5.0
- Maximum Walls Destroyed by RobotshardArrayBinary SearchDynamic ProgrammingSortingfrequency 5.0
- Maximum Xor ProductmediumMathGreedyBit Manipulationfrequency 5.0
- Maximum of Absolute Value ExpressionmediumArrayMathfrequency 5.0
- Memoizemediumfrequency 5.0
- Memoize IIhardfrequency 5.0
- Merge Nodes in Between ZerosmediumLinked ListSimulationfrequency 5.0
- Merge Operations for Minimum Travel TimehardArrayDynamic ProgrammingPrefix Sumfrequency 5.0
- Minimize Malware SpreadhardArrayHash TableDepth-First SearchBreadth-First Search+2frequency 5.0
- Minimize Maximum Component CostmediumBinary SearchUnion-FindGraph TheorySortingfrequency 5.0
- Minimize the Difference Between Target and Chosen ElementsmediumArrayDynamic ProgrammingMatrixfrequency 5.0
- Minimum Additions to Make Valid StringmediumStringDynamic ProgrammingStackGreedyfrequency 5.0
- Minimum Amount of Time to Collect GarbagemediumArrayStringPrefix Sumfrequency 5.0
- Minimum Amount of Time to Fill CupseasyArrayGreedySortingHeap (Priority Queue)frequency 5.0
- Minimum Array SummediumArrayDynamic Programmingfrequency 5.0
- Minimum Average of Smallest and Largest ElementseasyArrayTwo PointersSortingfrequency 5.0
- Minimum Cost for Cutting Cake IIhardArrayGreedySortingfrequency 5.0
- Minimum Cost to Convert String IIhardArrayStringDynamic ProgrammingGraph Theory+2frequency 5.0
- Minimum Cost to Make Array EqualhardArrayBinary SearchGreedySorting+1frequency 5.0
- Minimum Cost to Make Arrays IdenticalmediumArrayGreedySortingfrequency 5.0
- Minimum Deletions for At Most K Distinct CharacterseasyHash TableStringGreedySorting+1frequency 5.0
- Minimum Deletions to Make Character Frequencies UniquemediumHash TableStringGreedySortingfrequency 5.0
- Minimum Deletions to Make String K-SpecialmediumHash TableStringGreedySorting+1frequency 5.0
- Minimum Distance Between Three Equal Elements IeasyArrayHash Tablefrequency 5.0
- Minimum Distance Between Three Equal Elements IImediumArrayHash Tablefrequency 5.0
- Minimum Distance to the Target ElementeasyArrayfrequency 5.0
- Minimum Division Operations to Make Array Non DecreasingmediumArrayMathGreedyNumber Theoryfrequency 5.0
- Minimum Edge Reversals So Every Node Is ReachablehardDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph Theoryfrequency 5.0
- Minimum Fuel Cost to Report to the CapitalmediumTreeDepth-First SearchBreadth-First SearchGraph Theoryfrequency 5.0
- Minimum Index Sum of Two ListseasyArrayHash TableStringfrequency 5.0
- Minimum Insertions to Balance a Parentheses StringmediumStringStackGreedyBracket Sequencesfrequency 5.0
- Minimum K to Reduce Array Within LimitmediumArrayBinary Searchfrequency 5.0
- Minimum Moves to Spread Stones Over GridmediumArrayDynamic ProgrammingBacktrackingBit Manipulation+2frequency 5.0
- Minimum Number of Coins to be AddedmediumArrayGreedySortingfrequency 5.0
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.