Update min size subarray sum doc

Author: sudheerj

README.md

@@ -48,7 +48,8 @@ List of Programs related to data structures and algorithms
    5. Max sum subarray: [Source](https://github.com/sudheerj/datastructures-algorithms/blob/master/src/javascript/algorithms/array/5.maxSumSubarray/maxSumSubarray.js) 
    [Playground](https://livecodes.io/?console=open&x=https://github.com/sudheerj/datastructures-algorithms/blob/master/src/javascript/algorithms/array/5.maxSumSubarray/maxSumSubarray.js) [Documentation](https://github.com/sudheerj/datastructures-algorithms/blob/master/src/javascript/algorithms/array/5.maxSumSubarray/maxSumSubarray.md)
 
-   6. Minimum size subarray sum: [JavaScript](https://livecodes.io/?console=open&x=https://github.com/sudheerj/datastructures-algorithms/blob/master/src/javascript/algorithms/array/minimumSizeSubarraySum/minSizeSubarraySum.js) [Documentation](https://github.com/sudheerj/datastructures-algorithms/blob/master/src/javascript/algorithms/array/minimumSizeSubarraySum/minSizeSubarraySum.md)
+   6. Minimum size subarray sum: [Source](https://github.com/sudheerj/datastructures-algorithms/blob/master/src/javascript/algorithms/array/6.minimumSizeSubarraySum/minSizeSubarraySum.js) 
+   [Playground](https://livecodes.io/?console=open&x=https://github.com/sudheerj/datastructures-algorithms/blob/master/src/javascript/algorithms/array/6.minimumSizeSubarraySum/minSizeSubarraySum.js) [Documentation](https://github.com/sudheerj/datastructures-algorithms/blob/master/src/javascript/algorithms/array/6.minimumSizeSubarraySum/minSizeSubarraySum.md)
 
    7. Sort Colors: [JavaScript](https://livecodes.io/?console=open&x=https://github.com/sudheerj/datastructures-algorithms/blob/master/src/javascript/algorithms/array/sortColors/sortColors.js) [Documentation](https://github.com/sudheerj/datastructures-algorithms/blob/master/src/javascript/algorithms/array/sortColors/sortColors.md)
 

src/java1/algorithms/array/minimumSizeSubarraySum/MinimumSizeSubarraySum.md

@@ -1,4 +1,18 @@
-**Algorithmic Steps**
+**Description:**
+Given an array of positive integers `nums` and a positive integer `target`, return the minimal length of a contiguous
+subarray whose sum is greater than or equal to `target`. If there is no such subarray, return `0` instead.
+
+### Examples:
+#### Example 1:
+
+Input: target = 7, nums = [2,4,1,2,4,3]
+Output: 2
+
+#### Example 2:
+Input: target = 15, nums = [2, 2, 2, 2, 2]
+Output: 0
+
+**Algorithmic Steps:**
 This problem is solved with the help of sliding window approach without using any special data structure. The algorithmic approach can be summarized as follows:
 
 1. Initialize left and right pointers to 0, to keep track of the substring window boundaries.

src/javascript/algorithms/array/minimumSizeSubarraySum/minSizeSubarraySum.js src/javascript/algorithms/array/6.minimumSizeSubarraySum/minSizeSubarraySum.js

@@ -1,11 +1,25 @@
-**Algorithmic Steps**
+**Description:**
+Given an array of positive integers `nums` and a positive integer `target`, return the minimal length of a contiguous
+subarray whose sum is greater than or equal to `target`. If there is no such subarray, return `0` instead.
+
+### Examples:
+#### Example 1:
+
+Input: target = 7, nums = [2,4,1,2,4,3]
+Output: 2
+
+#### Example 2:
+Input: target = 15, nums = [2, 2, 2, 2, 2]
+Output: 0
+
+**Algorithmic Steps:**
 This problem is solved with the help of sliding window approach without using any special data structure. The algorithmic approach can be summarized as follows:
 
 1. Initialize left and right pointers to 0, to keep track of the substring window boundaries.
 
 2. Initialize total variable to 0, to store the sum of the subarray values to meet the target criteria.
 
-3. Initialize result variable to infinity to indicate that there is no subarray to meet target value.
+3. Initialize result variable to max integer value to indicate that there is no subarray to meet target value.
 
 4. Iterate over the input array using right pointer until the end of the string. 
 
@@ -17,7 +31,7 @@ This problem is solved with the help of sliding window approach without using an
 
 8. Repeat steps 4–7 until the right pointer reaches the end of the array.
 
-9. Return 0 if the result is still an infinity which indicates no valid subarray otherwise return the calculated minimum subarray value.
+9. Return 0 if the result is still a maximum integer which indicates no valid subarray otherwise return the calculated minimum subarray value.
 
 **Time and Space complexity:**
 This algorithm has a time complexity of O(n) because we are traversing the array only twice at max. Since it doens't require any datastructure, the space complexity will be O(1).