Skip to content

Practice Minimum Increment Operations to Make Array Beautiful

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2919
LeetCode Problem

Minimum Increment Operations to Make Array Beautiful

Problem Statement

One operation increases any nums entry by 1. Return the fewest increments needed so every contiguous subarray of length at least three contains an entry greater than or equal to k.

Source: Minimum Increment Operations to Make Array Beautiful on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [2,3,0,0,2], k = 4
Output
3

# Example 2

Input
nums = [0,1,3,3], k = 5
Output
2

# Example 3

Input
nums = [1,1,2], k = 1
Output
0

Constraints

3 <= n == nums.length <= 10^5
0 <= nums[i] <= 10^9
0 <= k <= 10^9

Related LeetCode Problems

Practice more problems similar to Minimum Increment Operations to Make Array Beautiful.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.