Practice Smallest Range II
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given an integer array nums and an integer k. For each index i where 0 <= i < nums.length, change nums[i] to be either nums[i] + k or nums[i] - k. The score of nums is the difference between the maximum and minimum elements in nums. Return the minimum score of nums after changing the values at each index.
Source: Smallest Range II on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1], k = 0
Output
0
# Example 2
Input
nums = [0,10], k = 2
Output
6
# Example 3
Input
nums = [1,3,6], k = 3
Output
3
Constraints
1 <= nums.length <= 10^4
0 <= nums[i] <= 10^4
0 <= k <= 10^4
Related LeetCode Problems
Practice more problems similar to Smallest Range II.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.