Smallest Range I Problem

Smallest Range I Problem — ExecCode Easy DSA Practice

Solve the Smallest Range I problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an integer array nums and an integer k. Your task is to compute the required answer and return the minimum score of nums after applying the mentioned operation at most once for each index in it. 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.

Examples

Input {"nums": [1], "k": 0}; Output 0. Input {"nums": [0, 10], "k": 2}; Output 6

Constraints

1 <= nums.length <= 10^4 0 <= nums[i] <= 10^4 0 <= k <= 10^4

Practice Smallest Range I free on ExecCode. Browse DSA problems, topic map, and placement guides.