4000–4099

Problems in this range: 47

• 4000. Largest Integer With Given Digit Sum
• 4001. Aggregate Two Time Series
• 4002. Count Valid Sequences
• 4003. Minimum Cost Path with Alternating Directions III
• 4004. Minimum Moves to Balance Circular Array II 🔒
• 4005. Minimum Operations to Make Array Equal III 🔒
• 4006. Count Valid Prefixes
• 4007. Widest Possible Fence
• 4008. Minimum Initial Strength to Defeat All Monsters
• 4009. Minimum Possible Maximum Waiting Time
• 4010. Maximize Pair Strength Using GCD
• 4011. Count Subarrays With Even Odd Ratio I
• 4012. Count of Unfinished Tasks After Each Shift
• 4013. Count Subarrays With Even Odd Ratio II
• 4014. Minimum Total Price After Applying Discounts
• 4015. Weighted Sum of a Tree
• 4016. Maximum Area of Two Non-Overlapping Square Submatrices
• 4017. Peaks in Array II
• 4018. Total Sum of Interaction Cost in Tree Groups II 🔒
• 4019. Merge Close Characters II 🔒
• 4020. Elevator Requests I
• 4021. Minimum Operations to Make a Rotated Palindrome I
• 4022. K-th Digit in Infinite String
• 4023. Elevator Requests II
• 4024. Nearest Available Drone
• 4025. Minimize the Maximum Waiting Time at Synchronized Traffic Lights
• 4026. Maximum Gap Between Stations
• 4027. Elevator Requests III
• 4028. Minimum Operations to Make a Rotated Palindrome II 🔒
• 4029. Elevator Requests IV 🔒
• 4030. Check ASCII Palindromic
• 4031. Find All Numbers Disappeared in an Array II
• 4032. Longest Subarray With at Most K Distinct Prime Factors
• 4033. Valid K-Unique Subarrays I
• 4034. Minimum Bishop Moves to Reach Target
• 4035. Maximum Valid Split Positions I
• 4036. Lexicographically Largest String After Pair Transformations
• 4037. Maximum Valid Split Positions II
• 4038. Count Integers Appearing in a Single Block
• 4039. Sum of Decoded Numbers
• 4040. Minimum Operations to Form Subset Sum I
• 4041. Minimum Operations to Form Subset Sum II
• 4042. Valid K-Unique Subarrays II 🔒
• 4043. Count Rotations With Exactly K Equal Adjacent Pairs
• 4044. Count Good Cyclic Rotations
• 4045. Count Robot Groups
• 4046. Minimum Cost Path With At Most K Turns