CodeSearch
pick a problem · learn it with an AI tutor — hints, not spoilers
37,000 problems · all sources
- 36. Valid SudokuMediumLeetCodeArrayHash TableMatrix
- 360. Sort Transformed ArrayMediumLeetCodeArrayMathTwo PointersSorting
- 3601. Find Drivers with Improved Fuel EfficiencyMediumLeetCodeDatabase
- 3603. Minimum Cost Path with Alternating Directions IIMediumLeetCodeArrayDynamic ProgrammingMatrix
- 3604. Minimum Time to Reach Destination in Directed GraphMediumLeetCodeGraph TheoryHeap (Priority Queue)Shortest Path
- 3607. Power Grid MaintenanceMediumLeetCodeArrayHash TableDepth-First SearchBreadth-First Search
- 3608. Minimum Time for K Connected ComponentsMediumLeetCodeBinary SearchUnion-FindGraph TheorySorting
- 361. Bomb EnemyMediumLeetCodeArrayDynamic ProgrammingMatrix
- 3610. Minimum Number of Primes to Sum to TargetMediumLeetCodeArrayMathDynamic ProgrammingNumber Theory
- 3611. Find Overbooked EmployeesMediumLeetCodeDatabase
- 3612. Process String with Special Operations IMediumLeetCodeStringSimulation
- 3613. Minimize Maximum Component CostMediumLeetCodeBinary SearchUnion-FindGraph TheorySorting
- 3616. Number of Student ReplacementsMediumLeetCodeArraySimulation
- 3618. Split Array by Prime IndicesMediumLeetCodeArrayMathNumber Theory
- 3619. Count Islands With Total Value Divisible by KMediumLeetCodeArrayDepth-First SearchBreadth-First SearchUnion-Find
- 362. Design Hit CounterMediumLeetCodeArrayBinary SearchDesignQueue
- 3623. Count Number of Trapezoids IMediumLeetCodeArrayHash TableMathGeometry
- 3626. Find Stores with Inventory ImbalanceMediumLeetCode
- 3627. Maximum Median Sum of Subsequences of Size 3MediumLeetCodeArrayMathGreedySorting
- 3628. Maximum Number of Subsequences After One InsertingMediumLeetCodeStringDynamic ProgrammingGreedyPrefix Sum
- 3629. Minimum Jumps to Reach End via Prime TeleportationMediumLeetCodeArrayHash TableMathBreadth-First Search
- 3631. Sort Threats by Severity and ExploitabilityMediumLeetCodeArraySorting
- 3634. Minimum Removals to Balance ArrayMediumLeetCodeArrayBinary SearchSliding WindowSorting
- 3635. Earliest Finish Time for Land and Water Rides IIMediumLeetCodeArrayTwo PointersBinary SearchGreedy
- 3638. Maximum Balanced ShipmentsMediumLeetCodeArrayDynamic ProgrammingStackGreedy
- 3639. Minimum Time to Activate StringMediumLeetCodeArrayBinary Search
- 364. Nested List Weight Sum IIMediumLeetCodeStackDepth-First SearchBreadth-First Search
- 3641. Longest Semi-Repeating SubarrayMediumLeetCodeArrayHash TableSliding Window
- 3642. Find Books with Polarized OpinionsMediumLeetCode
- 3644. Maximum K to Sort a PermutationMediumLeetCodeArrayBit Manipulation
- 3645. Maximum Total from Optimal Activation OrderMediumLeetCodeArrayTwo PointersGreedySorting
- 3647. Maximum Weight in Two BagsMediumLeetCodeArrayDynamic Programming
- 3648. Minimum Sensors to Cover GridMediumLeetCodeMath
- 3649. Number of Perfect PairsMediumLeetCodeArrayMathTwo PointersSorting
- 365. Water and Jug ProblemMediumLeetCodeMathDepth-First SearchBreadth-First Search
- 3650. Minimum Cost Path with Edge ReversalsMediumLeetCodeGraph TheoryHeap (Priority Queue)Shortest Path
- 3652. Best Time to Buy and Sell Stock using StrategyMediumLeetCodeArraySliding WindowPrefix Sum
- 3653. XOR After Range Multiplication Queries IMediumLeetCodeArrayDivide and ConquerSimulationPrefix Sum
- 3654. Minimum Sum After Divisible Sum DeletionsMediumLeetCodeArrayHash TableDynamic ProgrammingPrefix Sum
- 3656. Determine if a Simple Graph ExistsMediumLeetCodeArrayBinary SearchGraph TheorySorting
- 3657. Find Loyal CustomersMediumLeetCode
- 3659. Partition Array Into K-Distinct GroupsMediumLeetCodeArrayHash TableCounting
- 366. Find Leaves of Binary TreeMediumLeetCodeTreeDepth-First SearchBinary Tree
- 3660. Jump Game IXMediumLeetCodeArrayDynamic Programming
- 3664. Two-Letter Card GameMediumLeetCodeArrayHash TableStringCounting
- 3665. Twisted Mirror Path CountMediumLeetCodeArrayDynamic ProgrammingMatrix
- 3669. Balanced K-Factor DecompositionMediumLeetCodeMathBacktrackingNumber Theory
- 3670. Maximum Product of Two Integers With No Common BitsMediumLeetCodeArrayDynamic ProgrammingBit Manipulation
- 3672. Sum of Weighted Modes in SubarraysMediumLeetCodeArrayHash TableSliding WindowCounting
- 3675. Minimum Operations to Transform StringMediumLeetCodeStringGreedy
- 3676. Count Bowl SubarraysMediumLeetCodeArrayStackMonotonic Stack
- 3679. Minimum Discards to Balance InventoryMediumLeetCodeArrayHash TableSliding WindowSimulation
- 368. Largest Divisible SubsetMediumLeetCodeArrayMathDynamic ProgrammingSorting
- 3680. Generate ScheduleMediumLeetCodeArrayMathGreedy
- 3682. Minimum Index Sum of Common ElementsMediumLeetCodeArrayHash Table
- 3685. Subsequence Sum After Capping ElementsMediumLeetCodeArrayTwo PointersDynamic ProgrammingSorting
- 3689. Maximum Total Subarray Value IMediumLeetCodeArrayGreedy
- 369. Plus One Linked ListMediumLeetCodeLinked ListMath
- 3690. Split and Merge Array TransformationMediumLeetCodeArrayHash TableBreadth-First Search
- 3693. Climbing Stairs IIMediumLeetCodeArrayDynamic Programming