CodeSearch
pick a problem · learn it with an AI tutor — hints, not spoilers
37,000 problems · all sources
- 3710. Maximum Partition FactorHardLeetCodeArrayBinary SearchDepth-First SearchBreadth-First Search
- 3715. Sum of Perfect Square AncestorsHardLeetCodeArrayHash TableMathTree
- 3721. Longest Balanced Subarray IIHardLeetCodeArrayHash TableDivide and ConquerSegment Tree
- 3725. Count Ways to Choose Coprime Integers from RowsHardLeetCodeArrayMathDynamic ProgrammingMatrix
- 3729. Count Distinct Subarrays Divisible by K in Sorted ArrayHardLeetCodeArrayHash TablePrefix Sum
- 3734. Lexicographically Smallest Palindromic Permutation Greater Than TargetHardLeetCodeTwo PointersStringEnumeration
- 3735. Lexicographically Smallest String After Reverse IIHardLeetCodeStringBinary SearchRolling HashSuffix Array
- 3739. Count Subarrays With Majority Element IIHardLeetCodeArrayHash TableDivide and ConquerSegment Tree
- 3743. Maximize Cyclic Partition ScoreHardLeetCodeArrayDynamic Programming
- 3748. Count Stable SubarraysHardLeetCodeArrayBinary SearchPrefix Sum
- 3749. Evaluate Valid ExpressionsHardLeetCodeHash TableMathStringDivide and Conquer
- 3753. Total Waviness of Numbers in Range IIHardLeetCodeMathDynamic Programming
- 3757. Number of Effective SubsequencesHardLeetCodeArrayMathDynamic ProgrammingBit Manipulation
- 3762. Minimum Operations to Equalize SubarraysHardLeetCodeArrayMathBinary SearchSegment Tree
- 3764. Most Common Course PairsHardLeetCode
- 3768. Minimum Inversion Count in Subarrays of Fixed LengthHardLeetCodeArraySegment TreeSliding Window
- 3772. Maximum Subgraph Score in a TreeHardLeetCodeArrayDynamic ProgrammingTreeDepth-First Search
- 3777. Minimum Deletions to Make Alternating SubstringHardLeetCodeStringSegment Tree
- 3782. Last Remaining Integer After Alternating Deletion OperationsHardLeetCodeMathRecursion
- 3785. Minimum Swaps to Avoid Forbidden ValuesHardLeetCodeArrayHash TableGreedyCounting
- 3786. Total Sum of Interaction Cost in Tree GroupsHardLeetCodeArrayTreeDepth-First Search
- 3791. Number of Balanced Integers in a RangeHardLeetCodeDynamic Programming
- 3797. Count Routes to Climb a Rectangular GridHardLeetCodeArrayDynamic ProgrammingMatrixPrefix Sum
- 3801. Minimum Cost to Merge Sorted ListsHardLeetCodeArrayTwo PointersBinary SearchDynamic Programming
- 3802. Number of Ways to Paint SheetsHardLeetCode
- 3806. Maximum Bitwise AND After Increment OperationsHardLeetCodeArrayGreedyBit ManipulationSorting
- 381. Insert Delete GetRandom O(1) - Duplicates allowedHardLeetCodeArrayHash TableMathDesign
- 3812. Minimum Edge Toggles on a TreeHardLeetCodeTreeDepth-First SearchGraph TheoryTopological Sort
- 3816. Lexicographically Smallest String After Deleting Duplicate CharactersHardLeetCodeHash TableStringStackGreedy
- 3821. Find Nth Smallest Integer With K One BitsHardLeetCodeMathBit ManipulationCombinatorics
- 3826. Minimum Partition ScoreHardLeetCodeArrayDivide and ConquerDynamic ProgrammingQueue
- 3830. Longest Alternating Subarray After Removing At Most One ElementHardLeetCodeArrayDynamic ProgrammingEnumeration
- 3832. Find Users with Persistent Behavior PatternsHardLeetCode
- 3836. Maximum Score Using Exactly K PairsHardLeetCodeArrayDynamic Programming
- 3841. Palindromic Path Queries in a TreeHardLeetCodeArrayStringDivide and ConquerBit Manipulation
- 3845. Maximum Subarray XOR with Bounded RangeHardLeetCodeArrayBit ManipulationTrieQueue
- 3850. Count Sequences to KHardLeetCodeArrayMathDynamic ProgrammingMemoization
- 3855. Sum of K-Digit Numbers in a RangeHardLeetCodeMathDivide and ConquerCombinatoricsNumber Theory
- 3859. Count Subarrays With K Distinct IntegersHardLeetCodeArrayHash TableSliding WindowCounting
- 3864. Minimum Cost to Partition a Binary StringHardLeetCodeStringDivide and ConquerPrefix Sum
- 3869. Count Fancy Numbers in a RangeHardLeetCodeMathDynamic Programming
- 3873. Maximum Points Activated with One AdditionHardLeetCodeArrayHash TableUnion-Find
- 3878. Count Good SubarraysHardLeetCodeArrayStackBit ManipulationMonotonic Stack
- 3883. Count Non Decreasing Arrays With Given Digit SumsHardLeetCodeArrayDynamic ProgrammingPrefix Sum
- 388535 (Hard Version)2300Codeforcesbitmasksbrute forcedata structuresmath
- 3886. Sum of Sortable IntegersHardLeetCodeArrayMathSortingEnumeration
- 3887. Incremental Even-Weighted Cycle QueriesHardLeetCodeUnion-FindGraph Theory
- 3888. Minimum Operations to Make All Grid Elements EqualHardLeetCodeArrayMathMatrixPrefix Sum
- 3892. Minimum Operations to Achieve At Least K PeaksHardLeetCodeArrayDynamic Programming
- 3897. Maximum Value of Concatenated Binary SegmentsHardLeetCodeArrayGreedySorting
- 3901. Good Subsequence QueriesHardLeetCodeArrayMathSegment TreeNumber Theory
- 3906. Count Good Integers on a Grid PathHardLeetCodeDynamic Programming
- 391. Perfect RectangleHardLeetCodeArrayHash TableMathGeometry
- 3910. Count Connected Subgraphs with Even Node SumHardLeetCodeArrayBit ManipulationDepth-First SearchBreadth-First Search
- 3911. K-th Smallest Remaining Even Integer in Subarray QueriesHardLeetCodeArrayBinary Search
- 3915. Maximum Sum of Alternating Subsequence With Distance at Least KHardLeetCodeArrayDynamic ProgrammingSegment Tree
- 3916. Number of ZigZag Arrays IIIHardLeetCodeMathDynamic ProgrammingPrefix Sum
- 3920. Maximize Fixed Points After DeletionsHardLeetCodeArrayBinary SearchSorting
- 3924. Minimum Threshold Path With Limited Heavy EdgesHardLeetCodeBinary SearchBreadth-First SearchGraph Theory
- 3928. Minimum Cost to Buy Apples IIHardLeetCodeArrayGraph TheoryHeap (Priority Queue)Shortest Path