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
- Longest Subarray With Maximum Bitwise ANDmediumArrayBit ManipulationBrainteaserfrequency 10.5
- Matchsticks to SquaremediumArrayDynamic ProgrammingBacktrackingBit Manipulation+1frequency 10.5
- Maximize Active Section with Trade IIhardArrayStringBinary SearchSegment Treefrequency 10.5
- Maximize Subarray Sum After Removing All Occurrences of One ElementhardArrayHash TableDivide and ConquerDynamic Programming+2frequency 10.5
- Maximize the Confusion of an ExammediumStringBinary SearchSliding WindowPrefix Sumfrequency 10.5
- Maximize the Minimum Powered CityhardArrayBinary SearchGreedyQueue+2frequency 10.5
- Maximize the Number of Target Nodes After Connecting Trees ImediumTreeDepth-First SearchBreadth-First Searchfrequency 10.5
- Maximum Difference Between Even and Odd Frequency IIhardStringSliding WindowEnumerationPrefix Sumfrequency 10.5
- Maximum Height by Stacking CuboidshardArrayDynamic ProgrammingSortingfrequency 10.5
- Maximum Number of Visible PointshardArrayMathGeometrySliding Window+1frequency 10.5
- Maximum Number of Words You Can TypeeasyHash TableStringfrequency 10.5
- Maximum Square Area by Removing Fences From a FieldmediumArrayHash TableEnumerationfrequency 10.5
- Maximum Total Damage With Spell CastingmediumArrayHash TableTwo PointersBinary Search+3frequency 10.5
- Maximum Unique Subarray Sum After DeletioneasyArrayHash TableGreedyfrequency 10.5
- Minimize XORmediumGreedyBit Manipulationfrequency 10.5
- Minimum ASCII Delete Sum for Two StringsmediumStringDynamic ProgrammingLongest Common Subsequencefrequency 10.5
- Minimum Array EndmediumBit Manipulationfrequency 10.5
- Minimum Cost Tree From Leaf ValuesmediumArrayDynamic ProgrammingStackGreedy+2frequency 10.5
- Minimum Difference in Sums After Removal of ElementshardArrayDynamic ProgrammingHeap (Priority Queue)frequency 10.5
- Minimum Jumps to Reach End via Prime TeleportationmediumArrayHash TableMathBreadth-First Search+1frequency 10.5
- Minimum Moves to Make Array ComplementarymediumArrayHash TablePrefix Sumfrequency 10.5
- Minimum Moves to Move a Box to Their Target LocationhardArrayBreadth-First SearchHeap (Priority Queue)Matrixfrequency 10.5
- Minimum Number GameeasyArraySortingHeap (Priority Queue)Simulationfrequency 10.5
- Minimum Number of Changes to Make Binary String BeautifulmediumStringfrequency 10.5
- Minimum Number of Operations to Make Array ContinuoushardArrayHash TableBinary SearchSliding Windowfrequency 10.5
- Minimum Number of People to TeachmediumArrayHash TableGreedyfrequency 10.5
- Minimum Operations to Convert All Elements to ZeromediumArrayHash TableStackGreedy+1frequency 10.5
- Minimum Operations to Make Array Values Equal to KeasyArrayHash Tablefrequency 10.5
- Minimum Penalty for a ShopmediumStringPrefix Sumfrequency 10.5
- Minimum Removals to Balance ArraymediumArrayBinary SearchSliding WindowSortingfrequency 10.5
- Minimum Score Triangulation of PolygonmediumArrayDynamic ProgrammingTriangulationPolygonsfrequency 10.5
- Minimum String Length After Removing SubstringseasyStringStackSimulationfrequency 10.5
- Minimum Swaps to Make Strings EqualmediumMathStringGreedyfrequency 10.5
- Minimum Total Distance TraveledhardArrayDynamic ProgrammingSortingfrequency 10.5
- Most Common WordeasyArrayHash TableStringCountingfrequency 10.5
- Nested List Weight Sum IImediumStackDepth-First SearchBreadth-First Searchfrequency 10.5
- Number of Distinct IslandsmediumArrayHash TableDepth-First SearchBreadth-First Search+4frequency 10.5
- Number of Smooth Descent Periods of a StockmediumArrayMathTwo PointersDynamic Programming+1frequency 10.5
- Number of Sub-arrays of Size K and Average Greater than or Equal to ThresholdmediumArraySliding Windowfrequency 10.5
- Number of Ways to Assign Edge Weights IIhardArrayMathDynamic ProgrammingBit Manipulation+2frequency 10.5
- Number of Ways to Paint N × 3 GridhardDynamic ProgrammingGraph Coloringfrequency 10.5
- Path CrossingeasyHash TableStringfrequency 10.5
- Patients With a ConditioneasyDatabasefrequency 10.5
- Possible BipartitionmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theory+2frequency 10.5
- Power Grid MaintenancemediumArrayHash TableDepth-First SearchBreadth-First Search+4frequency 10.5
- Process String with Special Operations IIhardStringSimulationfrequency 10.5
- Process Tasks Using ServersmediumArrayHeap (Priority Queue)frequency 10.5
- Range Sum Query - MutablemediumArrayDivide and ConquerDesignBinary Indexed Tree+2frequency 10.5
- Reach End of Array With Max ScoremediumArrayGreedyfrequency 10.5
- Rearrange Products TableeasyDatabasefrequency 10.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.