Skip to content

Practice Smallest Range I

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#908
LeetCode Problem

Smallest Range I

ArrayMath

Problem Statement

You are given an integer array nums and an integer k. In one operation, you can choose any index i where 0 <= i < nums.length and change nums[i] to nums[i] + x where x is an integer from the range [-k, k]. You can apply this operation at most once for each index i. The score of nums is the difference between the maximum and minimum elements in nums. Return the minimum score of nums after applying the mentioned operation at most once for each index in it.

Source: Smallest Range I 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
0

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 I.

1 Two Sum Easy2 Add Two Numbers Medium4 Median of Two Sorted Arrays Hard7 Reverse Integer Medium9 Palindrome Number Easy
← Previous Sum of Subarray MinimumsNext → Snakes and Ladders

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free