day 21

Author: sachuverma

Leetcode Daily Challenge/December-2020/21. Smallest Range II.cpp

@@ -0,0 +1,48 @@
+/*
+Smallest Range II
+=================
+
+Given an array A of integers, for each integer A[i] we need to choose either x = -K or x = K, and add x to A[i] (only once).
+
+After this process, we have some array B.
+
+Return the smallest possible difference between the maximum value of B and the minimum value of B.
+
+Example 1:
+Input: A = [1], K = 0
+Output: 0
+Explanation: B = [1]
+
+Example 2:
+Input: A = [0,10], K = 2
+Output: 6
+Explanation: B = [2,8]
+
+Example 3:
+Input: A = [1,3,6], K = 3
+Output: 3
+Explanation: B = [4,6,3]
+
+Note:
+1 <= A.length <= 10000
+0 <= A[i] <= 10000
+0 <= K <= 10000
+*/
+
+class Solution
+{
+public:
+  int smallestRangeII(vector<int> &A, int K)
+  {
+    sort(A.begin(), A.end());
+    int ans = -A[0] + A[A.size() - 1];
+    for (int i = 0; i < A.size() - 1; ++i)
+    {
+      int j = i + 1;
+      int low = min(A[0] + K, A[j] - K);
+      int high = max(A[A.size() - 1] - K, A[i] + K);
+      ans = min(ans, high - low);
+    }
+    return ans;
+  }
+};

Leetcode Daily Challenge/December-2020/README.md

@@ -20,4 +20,6 @@
 | 16. | [Validate Binary Search Tree](https://leetcode.com/explore/challenge/card/december-leetcoding-challenge/571/week-3-december-15th-december-21st/3568/)              |          [cpp](./16.%20Validate%20Binary%20Search%20Tree.cpp)           |
 | 17. | [4Sum II](https://leetcode.com/explore/challenge/card/december-leetcoding-challenge/571/week-3-december-15th-december-21st/3569/)              |          [cpp](./17.%204Sum%20II.cpp)           |
 | 18. | [Increasing Triplet Subsequence](https://leetcode.com/explore/challenge/card/december-leetcoding-challenge/571/week-3-december-15th-december-21st/3570/)              |          [cpp](./18.%20Increasing%20Triplet%20Subsequence.cpp)           |
-| 19. | [Cherry Pickup II](https://leetcode.com/explore/challenge/card/december-leetcoding-challenge/571/week-3-december-15th-december-21st/3571/)              |          [cpp](./19.%20Cherry%20Pickup%20II.cpp)       
+| 19. | [Cherry Pickup II](https://leetcode.com/explore/challenge/card/december-leetcoding-challenge/571/week-3-december-15th-december-21st/3571/)              |          [cpp](./19.%20Cherry%20Pickup%20II.cpp)   |    
+| 20. | []() |[cpp](./20.%20.cpp)   |    
+| 21. | [Smallest Range II](https://leetcode.com/explore/challenge/card/december-leetcoding-challenge/571/week-3-december-15th-december-21st/3573/) |[cpp](./21.%20Smallest%20Range%20II.cpp)   |