solves min size subarray sum in java

Author: anishLearnsToCode

README.md

@@ -169,7 +169,7 @@
 | 206  | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list)                                                                                  |                                 [![Java](assets/java.png)](src/ReverseLinkedList.java) [![Python](assets/python.png)](python/reverse_linked_list.py)                                 |                                                                                                                                   |
 | 207  | [Course Schedule](https://leetcode.com/problems/course-schedule)                                                                                          |                                                                 [![Java](assets/java.png)](src/CourseSchedule.java)                                                                  |                                                                                                                                   |
 | 208  | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree)                                                                  |                                                                      [![Java](assets/java.png)](src/Trie.java)                                                                       |                                                                                                                                   |
-| 209  | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)                                                                      |                                                                                                                                                                                      |                                                                                                                                   |
+| 209  | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)                                                                      |                                                             [![Java](assets/java.png)](src/MinimumSizeSubarraySum.java)                                                              |                                                                                                                                   |
 | 210  | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii)                                                                                    |                                                                                                                                                                                      |                                                                                                                                   |
 | 211  | [Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure)                                    |                                                                                                                                                                                      |                                                                                                                                   |
 | 213  | [House Robber II](https://leetcode.com/problems/house-robber-ii)                                                                                          |                                                                                                                                                                                      |                                                                                                                                   |

src/MinimumSizeSubarraySum.java

@@ -0,0 +1,17 @@
+// https://leetcode.com/problems/minimum-size-subarray-sum
+// T: O(N)
+// S: O(1)
+
+public class MinimumSizeSubarraySum {
+    public int minSubArrayLen(int target, int[] array) {
+        int minSize = Integer.MAX_VALUE;
+        for (int left = 0, right = 0, sum = 0 ; right < array.length ; right++) {
+            sum += array[right];
+            while (sum >= target) {
+                minSize = Math.min(minSize, right - left + 1);
+                sum -= array[left++];
+            }
+        }
+        return minSize == Integer.MAX_VALUE ? 0 : minSize;
+    }
+}