packagemedium;

publicclassMinimumSizeSubarraySum {

publicintminSubArrayLen(ints,int[]nums) {

if(nums ==null ||nums.length ==0)return0;

inti =0,j =0,min =Integer.MAX_VALUE,sum =0;

while(j <nums.length){

sum +=nums[j++];

while(sum >=s){

min =Math.min(min,j-i);

sum -=nums[i++];

}

}

returnmin ==Integer.MAX_VALUE ?0 :min;

}

}

| # | Title | Solutions | Time | Space | Difficulty | Tag | Notes

|-----|----------------|------------------|-------|--------|------------|-----|------

|278|[First Bad Version](https://leetcode.com/problems/first-bad-version/)|[Solution](../../blob/master/EASY/src/easy/FirstBadVersion.java)| O(logn)|O(1) | Easy| Binary Search

|140|[Word Break II](https://leetcode.com/problems/word-break-ii/)|[Solution](../../blob/master/HARD/src/hard/WordBreakII.java)| |O(n^2) | Hard| Backtracking/DFS

|209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)|[Solution](../../blob/master/MEDIUMS/src/medium/MinimumSizeSubarraySum.java)| O(n)|O(1) | Medium| Binary Search

|140|[Word Break II](https://leetcode.com/problems/word-break-ii/)|[Solution](../../blob/master/HARD/src/hard/WordBreakII.java)| ? |O(n^2) | Hard| Backtracking/DFS

|139|[Word Break](https://leetcode.com/problems/word-break/)|[Solution](../../blob/master/MEDIUM/src/medium/WordBreak.java)| O(n^2)|O(n) | Medium| DP

|133|[Clone Graph](https://leetcode.com/problems/clone-graph/)|[Solution](../../blob/master/MEDIUM/src/medium/CloneGraph.java)| O(n)|O(n) | Medium| HashMap, BFS

|91|[Decode Ways](https://leetcode.com/problems/decode-ways/)|[Solution](../../blob/master/MEDIUM/src/medium/DecodeWays.java)| O(n)|O(n) | Medium| DP