CodeSearch
pick a problem · learn it with an AI tutor — hints, not spoilers
37,000 problems · all sources
- 2510. Check if There is a Path With Equal Number of 0's And 1'sMediumLeetCodeArrayDynamic ProgrammingMatrix
- 2512. Reward Top K StudentsMediumLeetCodeArrayHash TableStringSorting
- 2513. Minimize the Maximum of Two ArraysMediumLeetCodeMathBinary SearchNumber Theory
- 2516. Take K of Each Character From Left and RightMediumLeetCodeHash TableStringSliding Window
- 2517. Maximum Tastiness of Candy BasketMediumLeetCodeArrayBinary SearchGreedySorting
- 2521. Distinct Prime Factors of Product of ArrayMediumLeetCodeArrayHash TableMathNumber Theory
- 2522. Partition String Into Substrings With Values at Most KMediumLeetCodeStringDynamic ProgrammingGreedy
- 2523. Closest Prime Numbers in RangeMediumLeetCodeMathNumber Theory
- 2526. Find Consecutive Integers from a Data StreamMediumLeetCodeHash TableDesignQueueCounting
- 2527. Find Xor-Beauty of ArrayMediumLeetCodeArrayMathBit Manipulation
- 253. Meeting Rooms IIMediumLeetCodeArrayTwo PointersGreedySorting
- 2530. Maximal Score After Applying K OperationsMediumLeetCodeArrayGreedyHeap (Priority Queue)
- 2531. Make Number of Distinct Characters EqualMediumLeetCodeHash TableStringCounting
- 2533. Number of Good Binary StringsMediumLeetCodeDynamic Programming
- 2536. Increment Submatrices by OneMediumLeetCodeArrayMatrixPrefix Sum
- 2537. Count the Number of Good SubarraysMediumLeetCodeArrayHash TableSliding Window
- 2539. Count the Number of Good SubsequencesMediumLeetCodeHash TableMathStringCombinatorics
- 254. Factor CombinationsMediumLeetCodeBacktracking
- 2541. Minimum Operations to Make Array Equal IIMediumLeetCodeArrayMathGreedy
- 2542. Maximum Subsequence ScoreMediumLeetCodeArrayGreedySortingHeap (Priority Queue)
- 2545. Sort the Students by Their Kth ScoreMediumLeetCodeArraySortingMatrix
- 2546. Apply Bitwise Operations to Make Strings EqualMediumLeetCodeStringBit Manipulation
- 2548. Maximum Price to Fill a BagMediumLeetCodeArrayGreedySorting
- 255. Verify Preorder Sequence in Binary Search TreeMediumLeetCodeArrayStackTreeBinary Search Tree
- 2550. Count Collisions of Monkeys on a PolygonMediumLeetCodeMathRecursion
- 2554. Maximum Number of Integers to Choose From a Range IMediumLeetCodeArrayHash TableBinary SearchGreedy
- 2555. Maximize Win From Two SegmentsMediumLeetCodeArrayBinary SearchSliding Window
- 2556. Disconnect Path in a Binary Matrix by at Most One FlipMediumLeetCodeArrayDynamic ProgrammingDepth-First SearchBreadth-First Search
- 2557. Maximum Number of Integers to Choose From a Range IIMediumLeetCodeArrayBinary SearchGreedySorting
- 2559. Count Vowel Strings in RangesMediumLeetCodeArrayStringPrefix Sum
- 256. Paint HouseMediumLeetCodeArrayDynamic Programming
- 2560. House Robber IVMediumLeetCodeArrayBinary SearchDynamic ProgrammingGreedy
- 2563. Count the Number of Fair PairsMediumLeetCodeArrayTwo PointersBinary SearchSorting
- 2564. Substring XOR QueriesMediumLeetCodeArrayHash TableStringBit Manipulation
- 2567. Minimum Score by Changing Two ElementsMediumLeetCodeArrayGreedySorting
- 2568. Minimum Impossible ORMediumLeetCodeArrayBit ManipulationBrainteaser
- 2571. Minimum Operations to Reduce an Integer to 0MediumLeetCodeDynamic ProgrammingGreedyBit Manipulation
- 2572. Count the Number of Square-Free SubsetsMediumLeetCodeArrayMathDynamic ProgrammingBit Manipulation
- 2575. Find the Divisibility Array of a StringMediumLeetCodeArrayMathString
- 2576. Find the Maximum Number of Marked IndicesMediumLeetCodeArrayTwo PointersBinary SearchGreedy
- 2579. Count Total Number of Colored CellsMediumLeetCodeMath
- 2580. Count Ways to Group Overlapping RangesMediumLeetCodeArraySorting
- 2583. Kth Largest Sum in a Binary TreeMediumLeetCodeTreeBreadth-First SearchSortingBinary Tree
- 2587. Rearrange Array to Maximize Prefix ScoreMediumLeetCodeArrayGreedySortingPrefix Sum
- 2588. Count the Number of Beautiful SubarraysMediumLeetCodeArrayHash TableBit ManipulationPrefix Sum
- 259. 3Sum SmallerMediumLeetCodeArrayTwo PointersBinary SearchSorting
- 2590. Design a Todo ListMediumLeetCodeArrayHash TableStringDesign
- 2592. Maximize Greatness of an ArrayMediumLeetCodeArrayTwo PointersGreedySorting
- 2593. Find Score of an Array After Marking All ElementsMediumLeetCodeArrayHash TableSortingHeap (Priority Queue)
- 2594. Minimum Time to Repair CarsMediumLeetCodeArrayBinary Search
- 2596. Check Knight Tour ConfigurationMediumLeetCodeArrayDepth-First SearchBreadth-First SearchMatrix
- 2597. The Number of Beautiful SubsetsMediumLeetCodeArrayHash TableMathDynamic Programming
- 2598. Smallest Missing Non-negative Integer After OperationsMediumLeetCodeArrayHash TableMathGreedy
- 2599. Make the Prefix Sum Non-negativeMediumLeetCodeArrayGreedyHeap (Priority Queue)
- 260. Single Number IIIMediumLeetCodeArrayBit Manipulation
- 2601. Prime Subtraction OperationMediumLeetCodeArrayMathBinary SearchGreedy
- 2602. Minimum Operations to Make All Array Elements EqualMediumLeetCodeArrayBinary SearchSortingPrefix Sum
- 2606. Find the Substring With Maximum CostMediumLeetCodeArrayHash TableStringDynamic Programming
- 2607. Make K-Subarray Sums EqualMediumLeetCodeArrayMathGreedySorting
- 261. Graph Valid TreeMediumLeetCodeDepth-First SearchBreadth-First SearchUnion-FindGraph Theory