Get Minimum Increment
Given an integer array arr of length n, you can perform the following operation on the array at most once:
- Choose a subset of elements from the array such that no two selected elements are adjacent (i.e., no two selected elements are next to each other in the array).
- Choose a non-negative integer
x, and increase all the selected elements byx.
Determine the minimum non-negative integer x, required to make the array arr non-decreasing using at most one operation. If it is impossible, return -1.
Function Description
Complete the function getMinimumIncrement in the editor with the following parameter(s):
int arr[n]: the array
Returns
int: the minimum value of increment so that the array becomes non-decreasing
Example
Unlock to view complete problem details
and practice with sample input/output
Was this article helpful?
View Test Cases & Run Code requires membership
Input Variables
Execution Result:
