Add solution #908

Author: JoshCrozier

README.md

@@ -718,6 +718,7 @@
 905|[Sort Array By Parity](./solutions/0905-sort-array-by-parity.js)|Easy|
 906|[Super Palindromes](./solutions/0906-super-palindromes.js)|Hard|
 907|[Sum of Subarray Minimums](./solutions/0907-sum-of-subarray-minimums.js)|Medium|
+908|[Smallest Range I](./solutions/0908-smallest-range-i.js)|Easy|
 909|[Snakes and Ladders](./solutions/0909-snakes-and-ladders.js)|Medium|
 912|[Sort an Array](./solutions/0912-sort-an-array.js)|Medium|
 914|[X of a Kind in a Deck of Cards](./solutions/0914-x-of-a-kind-in-a-deck-of-cards.js)|Medium|

solutions/0908-smallest-range-i.js

@@ -0,0 +1,25 @@
+/**
+ * 908. Smallest Range I
+ * https://leetcode.com/problems/smallest-range-i/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var smallestRangeI = function(nums, k) {
+  return Math.max(Math.max(...nums) - Math.min(...nums) - 2 * k, 0);
+};