Add solution for longest subarray of 1s after deleeting one element

Author: kwnna15

sliding-window/longest-subarray/README.md

@@ -0,0 +1,41 @@
+# 1493. Longest Subarray of 1's After Deleting One Element
+
+## Description
+See https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/description/
+
+## Problem
+Given a binary array `nums`, you should delete one element from it.
+
+Return the size of the longest non-empty subarray containing only `1`'s in the resulting array. Return `0` if there is no such subarray.
+
+## Example 1
+
+```
+Input: nums = [1,1,0,1]
+Output: 3
+Explanation: After deleting the number in position 2, [1,1,1] contains 3 numbers with value of 1's.
+```
+
+## Example 2
+
+```
+Input: nums = [0,1,1,1,0,1,1,0,1]
+Output: 5
+Explanation: After deleting the number in position 4, [0,1,1,1,1,1,0,1] longest subarray with value of 1's is [1,1,1,1,1].
+```
+
+## Example 3
+
+```
+Input: nums = [1,1,1]
+Output: 2
+Explanation: You must delete one element.
+```
+
+## Constraints
+
+```
+Input: nums = [0,1,1,1,0,1,1,0,1]
+Output: 5
+Explanation: After deleting the number in position 4, [0,1,1,1,1,1,0,1] longest subarray with value of 1's is [1,1,1,1,1].
+```

sliding-window/longest-subarray/longestsubarray.py

@@ -0,0 +1,11 @@
+def longest(nums: list[int]) -> int:
+    zeros, left, right = 0, 0, 0
+    while right < len(nums):
+        if nums[right] == 0:
+            zeros += 1
+        if zeros > 1:
+            left += 1
+            if nums[left - 1] == 0:
+                zeros -= 1
+        right += 1
+    return (right - left) - 1

sliding-window/longest-subarray/longestsubarray_test.py

@@ -0,0 +1,26 @@
+from longestsubarray import longest
+
+
+def test_example_1():
+    nums = [1, 1, 0, 1]
+    assert longest(nums) == 3
+
+
+def test_example_2():
+    nums = [0, 1, 1, 1, 0, 1, 1, 0, 1]
+    assert longest(nums) == 5
+
+
+def test_example_3():
+    nums = [1, 1, 1, 1, 1]
+    assert longest(nums) == 4
+
+
+def test_example_4():
+    nums = [0, 0, 0, 0, 0]
+    assert longest(nums) == 0
+
+
+def test_example_6():
+    nums = [1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1]
+    assert longest(nums) == 5