3892. Minimum Operations to Achieve At Least K Peaks

You are given a ​​​​​​​circular integer array​​​​​​​ nums of length n. An index i is a peak if its value is strictly greater than its neighbors: - The previous neighbor of i is nums[i - 1] if i > 0, otherwise nums[n - 1]. - The next neighbor of i is nums[i + 1] if i < n - 1, otherwise nums[0]. You are allowed to perform the following operation any number of times: - Choose any index i and inc