Add solution for max consecuitve ones

Author: kwnna15

Diff for: sliding-window/consecutive-ones/README.md

@@ -0,0 +1,33 @@
+# 1004. Max Consecutive Ones III
+
+## Description
+See https://leetcode.com/problems/max-consecutive-ones-iii/description/
+
+## Problem
+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.
+```
+
+## Constraints
+
+```
+1 <= nums.length <= 105
+nums[i] is either 0 or 1.
+0 <= k <= nums.length
+```

Diff for: sliding-window/consecutive-ones/consecutiveones.py

@@ -0,0 +1,8 @@
+def longest(nums: list[int], k: int) -> int:
+    zeros, l = 0, 0
+    for r, n in enumerate(nums):
+        zeros += n == 0
+        if zeros > k:
+            zeros -= nums[l] == 0
+            l += 1
+    return r - l + 1

Diff for: sliding-window/consecutive-ones/consecutiveones_test.py

@@ -0,0 +1,31 @@
+from consecutiveones import longest
+
+
+def test_example_1():
+    nums = [1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0]
+    k = 2
+    assert longest(nums, k) == 6
+
+
+def test_example_2():
+    nums = [0, 0, 1, 1, 1, 0, 0]
+    k = 0
+    assert longest(nums, k) == 3
+
+
+def test_example_3():
+    nums = [1, 1, 1, 1, 1]
+    k = 0
+    assert longest(nums, k) == 5
+
+
+def test_example_4():
+    nums = [0, 0, 0, 0, 0]
+    k = 5
+    assert longest(nums, k) == 5
+
+
+def test_example_5():
+    nums = [1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1]
+    k = 3
+    assert longest(nums, k) == 11