CodeSearch
pick a problem · learn it with an AI tutor — hints, not spoilers
37,000 problems · all sources
- 3876. Construct Uniform Parity Array IIMediumLeetCodeArrayMath
- 3877. Minimum Removals to Achieve Target XORMediumLeetCodeArrayDynamic ProgrammingBit Manipulation
- 3879. Maximum Distinct Path Sum in a Binary TreeMediumLeetCodeHash TableTreeDepth-First SearchBinary Tree
- 388. Longest Absolute File PathMediumLeetCodeStringStackDepth-First Search
- 3881. Direction Assignments with Exactly K Visible PeopleMediumLeetCodeMathCombinatorics
- 3882. Minimum XOR Path in a GridMediumLeetCodeArrayDynamic ProgrammingBit ManipulationMatrix
- 3885. Design Event ManagerMediumLeetCodeArrayHash TableDesignHeap (Priority Queue)
- 388535 (Easy Version)1600Codeforcesbitmasksmath
- 3889. Mirror Frequency DistanceMediumLeetCodeHash TableStringCounting
- 3890. Integers With Multiple Sum of Two CubesMediumLeetCodeHash TableSortingCountingEnumeration
- 3891. Minimum Increase to Maximize Special IndicesMediumLeetCodeArrayDynamic ProgrammingGreedyPrefix Sum
- 3893. Maximum Team Size with Overlapping IntervalsMediumLeetCode
- 3895. Count Digit AppearancesMediumLeetCodeArrayMath
- 3896. Minimum Operations to Transform Array into Alternating PrimeMediumLeetCodeArrayMathTwo PointersBinary Search
- 3899. Angles of a TriangleMediumLeetCodeArrayMathGeometry
- 39. Combination SumMediumLeetCodeArrayBacktracking
- 390. Elimination GameMediumLeetCodeMathRecursion
- 3900. Longest Balanced Substring After One SwapMediumLeetCodeHash TableStringPrefix Sum
- 3902. Zigzag Level Sum of Binary TreeMediumLeetCodeTreeBreadth-First SearchBinary Tree
- 3904. Smallest Stable Index IIMediumLeetCodeArrayPrefix Sum
- 3905. Multi Source Flood FillMediumLeetCodeArrayBreadth-First SearchMatrix
- 3907. Count Smaller Elements With Opposite ParityMediumLeetCode
- 3909. Compare Sums of Bitonic PartsMediumLeetCodeArray
- 3913. Sort Vowels by FrequencyMediumLeetCodeStringSortingCounting
- 3914. Minimum Operations to Make Array Non DecreasingMediumLeetCodeArrayGreedy
- 3918. Sum of Primes Between Number and Its ReverseMediumLeetCodeMathNumber Theory
- 3919. Minimum Cost to Move Between IndicesMediumLeetCodeArrayGreedyPrefix Sum
- 3922. Minimum Flips to Make Binary String CoherentMediumLeetCodeString
- 3923. Minimum Generations to Target PointMediumLeetCodeArrayHash TableSimulation
- 3926. Count Valid Word OccurrencesMediumLeetCodeArrayHash TableStringCounting
- 3927. Minimize Array Sum Using Divisible ReplacementsMediumLeetCodeArrayHash TableMathGreedy
- 393. UTF-8 ValidationMediumLeetCodeArrayBit Manipulation
- 3932. Count K-th Roots in a RangeMediumLeetCodeMathBinary Search
- 3933. Largest Local Values in a Matrix IIMediumLeetCodeArrayMatrixPrefix Sum
- 3935. Power Update After K-th Largest Insertion IMediumLeetCodeArrayHash TableMathSegment Tree
- 3937. Minimum Operations to Make Array Modulo Alternating IMediumLeetCodeArrayEnumeration
- 3938. Maximum Path Intersection Sum in a GridMediumLeetCodeArrayDynamic ProgrammingMatrixPrefix Sum
- 394. Decode StringMediumLeetCodeStringStackRecursion
- 3941. Password StrengthMediumLeetCodeHash TableString
- 3942. Minimum Operations to Sort a PermutationMediumLeetCodeArray
- 3946. Maximum Number of Items From Sale IMediumLeetCodeArrayDynamic ProgrammingGreedy
- 3947. Maximum Number of Items From Sale IIMediumLeetCodeArrayGreedySortingHeap (Priority Queue)
- 395. Longest Substring with At Least K Repeating CharactersMediumLeetCodeHash TableStringDivide and ConquerSliding Window
- 3951. Minimum Energy to Maintain BrightnessMediumLeetCodeArraySorting
- 3952. Maximum Total Value of Covered IndicesMediumLeetCodeArrayStringDynamic ProgrammingGreedy
- 3955. Valid Binary Strings With Cost LimitMediumLeetCodeStringBacktrackingBit ManipulationEnumeration
- 3958. Minimum Cost to Split into Ones IIMediumLeetCodeMath
- 396. Rotate FunctionMediumLeetCodeArrayMathDynamic Programming
- 3960. Frequency Balance SubarrayMediumLeetCode
- 3961. Maximize Sum of Device RatingsMediumLeetCode
- 3964. Minimum Lights to Illuminate a RoadMediumLeetCode
- 3965. Finish Time of Tasks IMediumLeetCode
- 3968. Maximum Manhattan Distance After All MovesMediumLeetCode
- 3969. Valid Subarrays With Matching Sum Digits IMediumLeetCode
- 397. Integer ReplacementMediumLeetCodeDynamic ProgrammingGreedyBit ManipulationMemoization
- 3970. Shortest Path With At Most K Consecutive Identical CharactersMediumLeetCode
- 398. Random Pick IndexMediumLeetCodeHash TableMathReservoir SamplingRandomized
- 399. Evaluate DivisionMediumLeetCodeArrayStringDepth-First SearchBreadth-First Search
- 40. Combination Sum IIMediumLeetCodeArrayBacktracking
- 400. Nth DigitMediumLeetCodeMathBinary Search