Added Max Consecutive Ones

Author: ignacio-chiazzo

LeetcodeProblems/Algorithms/Max_Consecutive_Ones_III.js

@@ -0,0 +1,44 @@
+/*
+Max Consecutive Ones III
+https://leetcode.com/problems/max-consecutive-ones-iii
+
+Given a binary array nums and an integer k, return the maximum number of consecutive 1's 
+in the array if you can flip at most k 0's.
+
+Example 1:
+
+Input: nums = [1,1,1,0,0,0,1,1,1,1,0], k = 2
+Output: 6
+Explanation: [1,1,1,0,0,1,1,1,1,1,1]
+Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.
+Example 2:
+
+Input: nums = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], k = 3
+Output: 10
+Explanation: [0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,1,1]
+Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.
+*/
+
+var longestOnes = function(nums, k) {
+  let start = 0;
+  let end = 0; 
+  let maxWindow = 0;
+  while(start < nums.length && end < nums.length) {
+      if(k > 0 || nums[end] == 1) {
+          if(nums[end] == 0) { k--; }
+          maxWindow = Math.max(maxWindow, end - start + 1);
+          end++;
+      } else { // k = 0 and nums[end] == 0
+          while(k == 0 && start < nums.length) {
+              if(nums[start] == 0) {
+                  k++;
+              }
+              start++;
+          }
+      }
+  }
+  
+  return maxWindow;
+};
+
+module.exports.longestOnes = longestOnes;

LeetcodeProblemsTests/Algorithms/Max_Consecutive_Ones_III_Test.js

@@ -0,0 +1,12 @@
+const assert = require('assert');
+const longestOnes = require('../../LeetcodeProblems/Algorithms/Max_Consecutive_Ones_III').longestOnes;
+
+function test() {
+  assert.equal(1, longestOnes([1], 1));
+  assert.equal(1, longestOnes([0], 1));
+  assert.equal(0, longestOnes([0], 0));
+  assert.equal(6, longestOnes([1,1,1,0,0,0,1,1,1,1,0], 2));
+  assert.equal(10, longestOnes([0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], 3));
+}
+
+module.exports.test = test;

LeetcodeProblemsTests/Algorithms/Minimum_Size_Subarray_Test.js

@@ -0,0 +1,15 @@
+const assert = require('assert');
+const minSubArrayLength = require('../../LeetcodeProblems/Algorithms/Minimum_Size_Subarray').minSubArrayLength;
+
+function test() {
+  assert.equal(0, minSubArrayLength(10, []));
+  assert.equal(0, minSubArrayLength(10, [4,1,2]));
+  assert.equal(2, minSubArrayLength(4, [1,1,1,1, 3, 1]));
+  assert.equal(1, minSubArrayLength(11, [5, 6, 12, 3, 1]));
+  assert.equal(5, minSubArrayLength(5, [1,1,1,1,1]));
+  assert.equal(2, minSubArrayLength(7, [2,3,1,2,4,3]));
+  assert.equal(1, minSubArrayLength(4, [1,4,4]));
+  assert.equal(0, minSubArrayLength(11, [1,1,1,1,1,1,1,1]));
+}
+
+module.exports.test = test;

README.md

@@ -38,7 +38,9 @@ To run a specific problem in your console run  `node <problem_file_path>` (e.g.
 | [Longest Palindromic Substring ](/LeetcodeProblems/Algorithms/Longest_Palindromic_Substring.js)                 | Medium | https://leetcode.com/problems/longest-palindromic-substring/|
 | [Longest Substring Without Reapeating Characters](/LeetcodeProblems/Algorithms/Longest_Substring.js)            | Medium | https://leetcode.com/problems/longest-substring-without-repeating-characters|
 | [Max Area Of Island ](/LeetcodeProblems/Algorithms/Max_Area_Of_Island.js)                                       | Medium | https://leetcode.com/problems/max-area-of-island/ |
+| [Max Consecutive Ones III ](/LeetcodeProblems/Algorithms/Max_Consecutive_Ones_III.js)                                       | Medium | https://leetcode.com/problems/max-consecutive-ones-iii |
 | [Maximal Square ](/LeetcodeProblems/Algorithms/Maximal_Square.js)                                               | Medium | https://leetcode.com/problems/maximal-square/ |
+| [Minimum Size Subarray](/LeetcodeProblems/Algorithms/Minimum_Size_Subarray.js)                                  | Medium | https://leetcode.com/problems/minimum-size-subarray-sum |
 | [Permutations ](/LeetcodeProblems/Algorithms/Permutations.js)                                                   | Medium | https://leetcode.com/problems/permutations/ |
 | [Permutations II ](/LeetcodeProblems/Algorithms/Permutations_II.js)                                             | Medium | https://leetcode.com/problems/permutations-ii/ |
 | [Permutations Without Duplicates ](/LeetcodeProblems/Algorithms/Permutations_Without_Duplicates.js)             | Medium | https://leetcode.com/problems/permutations/ |