CodeSearch
pick a problem · learn it with an AI tutor — hints, not spoilers
37,000 problems · all sources
- 2478. Number of Beautiful PartitionsHardLeetCodeStringDynamic ProgrammingPrefix Sum
- 2479. Maximum XOR of Two Non-Overlapping SubtreesHardLeetCodeTreeDepth-First SearchGraph TheoryTrie
- 248. Strobogrammatic Number IIIHardLeetCodeArrayStringRecursion
- 2484. Count Palindromic SubsequencesHardLeetCodeStringDynamic Programming
- 2488. Count Subarrays With Median KHardLeetCodeArrayHash TablePrefix Sum
- 2493. Divide Nodes Into the Maximum Number of GroupsHardLeetCodeDepth-First SearchBreadth-First SearchUnion-FindGraph Theory
- 2494. Merge Overlapping Events in the Same HallHardLeetCodeDatabase
- 2499. Minimum Total Cost to Make Arrays UnequalHardLeetCodeArrayHash TableGreedyCounting
- 25. Reverse Nodes in k-GroupHardLeetCodeLinked ListRecursion
- 2503. Maximum Number of Points From Grid QueriesHardLeetCodeArrayTwo PointersBreadth-First SearchUnion-Find
- 2508. Add Edges to Make Degrees of All Nodes EvenHardLeetCodeHash TableGraph Theory
- 2509. Cycle Length Queries in a TreeHardLeetCodeArrayTreeBinary Tree
- 2514. Count AnagramsHardLeetCodeHash TableMathStringCombinatorics
- 2518. Number of Great PartitionsHardLeetCodeArrayDynamic Programming
- 2519. Count the Number of K-Big IndicesHardLeetCodeArrayBinary SearchDivide and ConquerBinary Indexed Tree
- 2524. Maximum Frequency Score of a SubarrayHardLeetCodeArrayHash TableMathStack
- 2528. Maximize the Minimum Powered CityHardLeetCodeArrayBinary SearchGreedyQueue
- 2532. Time to Cross a BridgeHardLeetCodeArrayHeap (Priority Queue)Simulation
- 2534. Time Taken to Cross the DoorHardLeetCodeArrayQueueSimulation
- 2538. Difference Between Maximum and Minimum Price SumHardLeetCodeArrayDynamic ProgrammingTreeDepth-First Search
- 2543. Check if Point Is ReachableHardLeetCodeMathNumber Theory
- 2547. Minimum Cost to Split an ArrayHardLeetCodeArrayHash TableDynamic ProgrammingCounting
- 2551. Put Marbles in BagsHardLeetCodeArrayGreedySortingHeap (Priority Queue)
- 2552. Count Increasing QuadrupletsHardLeetCodeArrayDynamic ProgrammingBinary Indexed TreeEnumeration
- 2561. Rearranging FruitsHardLeetCodeArrayHash TableGreedySort
- 2565. Subsequence With the Minimum ScoreHardLeetCodeTwo PointersStringBinary Search
- 2569. Handling Sum Queries After UpdateHardLeetCodeArraySegment Tree
- 2573. Find the String with LCPHardLeetCodeArrayStringDynamic ProgrammingGreedy
- 2577. Minimum Time to Visit a Cell In a GridHardLeetCodeArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)
- 2581. Count Number of Possible Root NodesHardLeetCodeArrayHash TableDynamic ProgrammingTree
- 2584. Split the Array to Make Coprime ProductsHardLeetCodeArrayHash TableMathNumber Theory
- 2585. Number of Ways to Earn PointsHardLeetCodeArrayDynamic Programming
- 2589. Minimum Time to Complete All TasksHardLeetCodeArrayBinary SearchStackGreedy
- 2603. Collect Coins in a TreeHardLeetCodeArrayTreeGraph TheoryTopological Sort
- 2604. Minimum Time to Eat All GrainsHardLeetCodeArrayTwo PointersBinary SearchSorting
- 2608. Shortest Cycle in a GraphHardLeetCodeBreadth-First SearchGraph Theory
- 2612. Minimum Reverse OperationsHardLeetCodeArrayHash TableBreadth-First SearchUnion-Find
- 2613. Beautiful PairsHardLeetCodeArrayMathDivide and ConquerGeometry
- 2617. Minimum Number of Visited Cells in a GridHardLeetCodeArrayDynamic ProgrammingStackBreadth-First Search
- 262. Trips and UsersHardLeetCodeDatabase
- 2630. Memoize IIHardLeetCode
- 2642. Design Graph With Shortest Path CalculatorHardLeetCodeGraph TheoryDesignHeap (Priority Queue)Shortest Path
- 2646. Minimize the Total Price of the TripsHardLeetCodeArrayDynamic ProgrammingTreeDepth-First Search
- 2647. Color the Triangle RedHardLeetCodeArrayMath
- 265. Paint House IIHardLeetCodeArrayDynamic Programming
- 2650. Design Cancellable FunctionHardLeetCode
- 2659. Make Array EmptyHardLeetCodeArrayBinary SearchGreedyBinary Indexed Tree
- 2663. Lexicographically Smallest Beautiful StringHardLeetCodeStringGreedy
- 2675. Array of Objects to MatrixHardLeetCode
- 2681. Power of HeroesHardLeetCodeArrayMathDynamic ProgrammingSorting
- 269. Alien DictionaryHardLeetCodeArrayStringDepth-First SearchBreadth-First Search
- 2691. Immutability HelperHardLeetCode
- 2699. Modify Graph Edge WeightsHardLeetCodeGraph TheoryHeap (Priority Queue)Shortest Path
- 2701. Consecutive Transactions with Increasing AmountsHardLeetCodeDatabase
- 2702. Minimum Operations to Make Numbers Non-positiveHardLeetCodeArrayBinary Search
- 2709. Greatest Common Divisor TraversalHardLeetCodeArrayMathUnion-FindNumber Theory
- 2713. Maximum Strictly Increasing Cells in a MatrixHardLeetCodeArrayHash TableBinary SearchDynamic Programming
- 2714. Find Shortest Path with K HopsHardLeetCodeGraph TheoryHeap (Priority Queue)Shortest Path
- 2719. Count of IntegersHardLeetCodeMathStringDynamic Programming
- 272. Closest Binary Search Tree Value IIHardLeetCodeTwo PointersStackTreeDepth-First Search