3900–3999

Problems in this range: 100

• 3900. Longest Balanced Substring After One Swap
• 3901. Good Subsequence Queries
• 3902. Zigzag Level Sum of Binary Tree 🔒
• 3903. Smallest Stable Index I
• 3904. Smallest Stable Index II
• 3905. Multi Source Flood Fill
• 3906. Count Good Integers on a Grid Path
• 3907. Count Smaller Elements With Opposite Parity 🔒
• 3908. Valid Digit Number
• 3909. Compare Sums of Bitonic Parts
• 3910. Count Connected Subgraphs with Even Node Sum
• 3911. K-th Smallest Remaining Even Integer in Subarray Queries
• 3912. Valid Elements in an Array
• 3913. Sort Vowels by Frequency
• 3914. Minimum Operations to Make Array Non Decreasing
• 3915. Maximum Sum of Alternating Subsequence With Distance at Least K
• 3916. Number of ZigZag Arrays III 🔒
• 3917. Count Indices With Opposite Parity
• 3918. Sum of Primes Between Number and Its Reverse
• 3919. Minimum Cost to Move Between Indices
• 3920. Maximize Fixed Points After Deletions
• 3921. Score Validator
• 3922. Minimum Flips to Make Binary String Coherent
• 3923. Minimum Generations to Target Point
• 3924. Minimum Threshold Path With Limited Heavy Edges
• 3925. Concatenate Array With Reverse
• 3926. Count Valid Word Occurrences
• 3927. Minimize Array Sum Using Divisible Replacements
• 3928. Minimum Cost to Buy Apples II
• 3929. Minimum Partition Score II 🔒
• 3930. Power Update After K-th Largest Insertion II 🔒
• 3931. Check Adjacent Digit Differences
• 3932. Count K-th Roots in a Range
• 3933. Largest Local Values in a Matrix II
• 3934. Smallest Unique Subarray
• 3935. Power Update After K-th Largest Insertion I 🔒
• 3936. Minimum Swaps to Move Zeros to End
• 3937. Minimum Operations to Make Array Modulo Alternating I
• 3938. Maximum Path Intersection Sum in a Grid
• 3939. Count Non Adjacent Subsets in a Rooted Tree
• 3940. Limit Occurrences in Sorted Array
• 3941. Password Strength
• 3942. Minimum Operations to Sort a Permutation
• 3943. Number of Pairs After Increment
• 3944. Minimum Operations to Make Array Modulo Alternating II 🔒
• 3945. Digit Frequency Score
• 3946. Maximum Number of Items From Sale I
• 3947. Maximum Number of Items From Sale II
• 3948. Lexicographically Maximum MEX Array
• 3949. Subtree Inversion Sum II 🔒
• 3950. Exactly One Consecutive Set Bits Pair
• 3951. Minimum Energy to Maintain Brightness
• 3952. Maximum Total Value of Covered Indices
• 3953. Maximum Score with Co-Prime Element
• 3954. Sum of Compatible Numbers in Range I
• 3955. Valid Binary Strings With Cost Limit
• 3956. Maximum Sum of M Non-Overlapping Subarrays I
• 3957. Maximum Sum of M Non-Overlapping Subarrays II
• 3958. Minimum Cost to Split into Ones II 🔒
• 3959. Check Good Integer
• 3960. Frequency Balance Subarray
• 3961. Maximize Sum of Device Ratings
• 3962. Maximum Subarray Sum After at Most K Swaps
• 3963. Create Grid With Exactly One Path
• 3964. Minimum Lights to Illuminate a Road
• 3965. Finish Time of Tasks I
• 3966. Count Good Integers in a Range
• 3967. Finish Time of Tasks II 🔒
• 3968. Maximum Manhattan Distance After All Moves
• 3969. Valid Subarrays With Matching Sum Digits I
• 3970. Shortest Path With At Most K Consecutive Identical Characters
• 3971. Maximum Total Value
• 3972. Valid Subarrays With Matching Sum Digits II 🔒
• 3973. Distinct Gate Paths to LCA 🔒
• 3974. Maximum Total Sum of K Selected Elements
• 3975. Filter Occupied Intervals
• 3976. Maximum Subarray Sum After Multiplier
• 3977. Minimum Time to Reach Target With Limited Power
• 3978. Unique Middle Element
• 3979. Maximum Valid Pair Sum
• 3980. Minimum Operations to Transform Binary String
• 3981. Count Distinct Ways to Form Target from Two Strings
• 3982. Sum of Integers with Maximum Digit Range
• 3983. Subsequence After One Replacement
• 3984. Divisible Game
• 3985. Palindromic Subarray Sum
• 3986. Number of Elapsed Seconds Between Two Times
• 3987. Minimum Total Cost to Process All Elements
• 3988. Create Grid With Exactly K Paths I
• 3989. Maximum Consistent Columns in a Grid
• 3990. Create Grid With Exactly K Paths II 🔒
• 3991. Sort Array Using Prefix Reversals 🔒
• 3992. Rearrange String to Avoid Character Pair
• 3993. Maximum Value of an Alternating Sequence
• 3994. Minimum Adjacent Swaps to Partition Array
• 3995. Minimum Cost to Convert String III
• 3996. Even Number of Knight Moves
• 3997. Count Dominant Nodes in a Binary Tree
• 3998. Transform Binary String Using Subsequence Sort
• 3999. Minimum Number of String Groups Through Transformations