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
- Minimum Number of Moves to Seat EveryoneeasyArrayGreedySortingCounting Sortfrequency 5.0
- Minimum Number of Pushes to Type Word IImediumHash TableStringGreedySorting+1frequency 5.0
- Minimum Number of Removals to Make Mountain ArrayhardArrayBinary SearchDynamic ProgrammingGreedyfrequency 5.0
- Minimum Number of Seconds to Make Mountain Height ZeromediumArrayMathBinary SearchGreedy+1frequency 5.0
- Minimum Operations to Exceed Threshold Value IImediumArrayHeap (Priority Queue)Simulationfrequency 5.0
- Minimum Operations to Make Array Equal to TargethardArrayDynamic ProgrammingStackGreedy+1frequency 5.0
- Minimum Operations to Reduce an Integer to 0mediumDynamic ProgrammingGreedyBit Manipulationfrequency 5.0
- Minimum Pair Removal to Sort Array IIhardArrayHash TableLinked ListHeap (Priority Queue)+3frequency 5.0
- Minimum Score After Removals on a TreehardArrayBit ManipulationTreeDepth-First Searchfrequency 5.0
- Minimum Swaps To Make Sequences IncreasinghardArrayDynamic Programmingfrequency 5.0
- Minimum Swaps to Group All 1's Together IImediumArraySliding Windowfrequency 5.0
- Minimum Time to Complete All DeliveriesmediumMathBinary Searchfrequency 5.0
- Minimum Time to Complete All TaskshardArrayBinary SearchStackGreedy+1frequency 5.0
- Minimum XOR Path in a GridmediumArrayDynamic ProgrammingBit ManipulationMatrixfrequency 5.0
- Monotone Increasing DigitsmediumMathGreedyfrequency 5.0
- Most Profitable Path in a TreemediumArrayTreeDepth-First SearchBreadth-First Search+1frequency 5.0
- Movement of RobotsmediumArrayBrainteaserSortingPrefix Sumfrequency 5.0
- Neighboring Bitwise XORmediumArrayBit Manipulationfrequency 5.0
- Non-decreasing SubsequencesmediumArrayHash TableBacktrackingBit Manipulationfrequency 5.0
- Number of Arithmetic TripletseasyArrayHash TableTwo PointersEnumerationfrequency 5.0
- Number of Distinct AverageseasyArrayHash TableTwo PointersSortingfrequency 5.0
- Number of Orders in the BacklogmediumArrayHeap (Priority Queue)Simulationfrequency 5.0
- Number of Pairs of Interchangeable RectanglesmediumArrayHash TableMathCounting+1frequency 5.0
- Number of Same-End SubstringsmediumArrayHash TableStringCounting+1frequency 5.0
- Number of Subarrays With LCM Equal to KmediumArrayMathNumber Theoryfrequency 5.0
- Number of Valid Move Combinations On ChessboardhardArrayStringBacktrackingSimulationfrequency 5.0
- Numbers At Most N Given Digit SethardArrayMathStringBinary Search+1frequency 5.0
- Odd and Even TransactionsmediumDatabasefrequency 5.0
- Partition Array Into K-Distinct GroupsmediumArrayHash TableCountingfrequency 5.0
- Partition Array Into Three Parts With Equal SumeasyArrayGreedyfrequency 5.0
- Partition Array into Disjoint IntervalsmediumArrayfrequency 5.0
- Partition Array to Minimize XORmediumArrayDynamic ProgrammingBit ManipulationPrefix Sumfrequency 5.0
- Pass the PilloweasyMathSimulationfrequency 5.0
- Poor PigshardMathDynamic ProgrammingCombinatoricsfrequency 5.0
- Prefix and Suffix SearchhardArrayHash TableStringDesign+1frequency 5.0
- Prime In DiagonaleasyArrayMathMatrixNumber Theoryfrequency 5.0
- Print Zero Even OddmediumConcurrencyfrequency 5.0
- Process String with Special Operations ImediumStringSimulationfrequency 5.0
- Queens That Can Attack the KingmediumArrayMatrixSimulationfrequency 5.0
- Random Pick IndexmediumHash TableMathReservoir SamplingRandomizedfrequency 5.0
- Reachable Nodes In Subdivided GraphhardGraph TheoryHeap (Priority Queue)Shortest PathDijkstra's Algorithmfrequency 5.0
- Reachable Nodes With RestrictionsmediumArrayHash TableTreeDepth-First Search+3frequency 5.0
- Read N Characters Given Read4easyArraySimulationInteractivefrequency 5.0
- Rearrange Words in a SentencemediumStringSortingfrequency 5.0
- Rectangle OverlapeasyMathGeometryfrequency 5.0
- Remove Max Number of Edges to Keep Graph Fully TraversablehardUnion-FindGraph Theoryfrequency 5.0
- Remove Methods From ProjectmediumDepth-First SearchBreadth-First SearchGraph Theoryfrequency 5.0
- Remove One Element to Make the Array Strictly IncreasingeasyArrayfrequency 5.0
- Remove Palindromic SubsequenceseasyTwo PointersStringfrequency 5.0
- Reorder Data in Log FilesmediumArrayStringSortingfrequency 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.