4000–4099

Problems in this range: 82

• 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
• 4047. Minimum Operations to Make XOR of All Elements Zero 🔒
• 4048. Count Values With Equally Spaced Occurrences I
• 4049. Count Values With Equally Spaced Occurrences II
• 4050. Minimum Days to Score Exactly N Points
• 4051. Count Subarrays with Distant Sums
• 4052. Cyclically Shift Rows and Columns
• 4053. Minimum Operations to Make Every Element Palindromic
• 4054. Count Shadow Pairs I
• 4055. Count Shadow Pairs II
• 4056. Number of Intersecting Interval Pairs I
• 4057. Number of Intersecting Interval Pairs II
• 4058. Maximum Pulse Value After One Subarray Rotation
• 4059. Lexicographically Largest Power Array
• 4060. Count Evenly Good Integers 🔒
• 4061. Minimum Queen Moves to Reach Target
• 4062. Transform Array Using Pair Operations
• 4063. Longest Subarray Divisible by K with At Most One Negation I
• 4064. Longest Subarray Divisible by K with At Most One Negation II
• 4065. Rearrange Array by Removing Distinct Values
• 4066. Maximum Equal Adjacent Pairs After at Most One Replacement
• 4067. Longest Subarray With Restricted Pair Sums
• 4068. Maximize Meeting Earnings with Idle Gaps
• 4069. Best Time to Buy and Sell Stock with Cooldown II 🔒
• 4070. Minimum Rotations to Dial a Number I
• 4071. Minimum Rotations to Dial a Number II
• 4072. Maximum Alternating Subarray Sum With One Deletion
• 4073. Count Good Strings
• 4074. Maximum Product Pair With Target Sum
• 4075. Longest Resilient Subarray I
• 4076. Longest Resilient Subarray II
• 4077. Minimize Inversions in a Prefix Tree
• 4078. Three Fibonacci Sum
• 4079. Prime Subset Selection I
• 4080. Design Bus Seat Booking System
• 4081. Prime Subset Selection II