Smallest Missing Non-negative Integer After Operations
You receive a 0-indexed integer array nums and an integer value.
In one operation, you can add or subtract value from any element of nums.
- For example, if
nums = [1,2,3]andvalue = 2, you can choose to subtractvaluefromnums[0]to makenums = [-1,2,3].
The MEX (fewest excluded) of an array is the smallest missing non-negative integer in it.
- For example, the MEX of
[-1,2,3]is0while the MEX of[1,0,3]is2.
Find and provide the largest MEX of nums after applying the mentioned operation any count of times.
Input: nums = [1,-10,7,13,6,8], value = 5
Output: 4
Explanation: One can achieve this result by applying the following operations:
-
Add value to nums[1] twice to make nums = [1, 0,7,13,6,8]
-
Subtract value from nums[2] once to make nums = [1,0, 2,13,6,8]
-
Subtract value from nums[3] twice to make nums = [1,0,2, 3,6,8]
The MEX of nums is 4. It can be shown that 4 is the largest MEX we can achieve.
Input: nums = [1,-10,7,13,6,8], value = 7
Output: 2
Explanation: One can achieve this result by applying the following operation:
- Subtract value from nums[2] once to make nums = [1,-10, 0,13,6,8]
The MEX of nums is 2. It can be shown that 2 is the largest MEX we can achieve.
Constraints
1 <= nums.length, value <= 10^5-10^9<= nums[i] <= 10^9
Did this problem appear in one of your interviews?
Responses stay private.