Problem: Minimum Operations to Achieve At Least K Peaks

Try to solve the Minimum Operations to Achieve At Least K Peaks problem.

Statement

You are given a circular integer array nums of length n and an integer k.

An element nums[i] is considered a peak if it is strictly greater than both of its adjacent neighbors, nums[(i - 1 + n) % n] and nums[(i + 1) % n].

In one operation, you can choose any index i and increment nums[i] by $1$ .

Return the minimum total number of operations required to make the array contain at least k peaks. If it is impossible to have at least k peaks, return $-1$ .

Constraints:

$2 \leq n ==$ nums.length $\leq 5000$
$-10^5 \leq$ nums[i] $\leq 10^5$
$0 \leq k \leq n$

Problem: Minimum Operations to Achieve At Least K Peaks

Try to solve the Minimum Operations to Achieve At Least K Peaks problem.

Statement

You are given a circular integer array nums of length n and an integer k.

An element nums[i] is considered a peak if it is strictly greater than both of its adjacent neighbors, nums[(i - 1 + n) % n] and nums[(i + 1) % n].

In one operation, you can choose any index i and increment nums[i] by $1$ .

Return the minimum total number of operations required to make the array contain at least k peaks. If it is impossible to have at least k peaks, return $-1$ .

Constraints:

$2 \leq n ==$ nums.length $\leq 5000$
$-10^5 \leq$ nums[i] $\leq 10^5$
$0 \leq k \leq n$

Problem: Minimum Operations to Achieve At Least K Peaks

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Minimum Operations to Achieve At Least K Peaks

Statement

Examples

Understand the problem

Figure it out!

Try it yourself