problem: 1493. Longest Subarray of 1's After Deleting One Element

Author: flynnpark

solutions/solution_1493/README.md

@@ -0,0 +1,34 @@
+# 1493. [Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/?envType=study-plan-v2&id=leetcode-75)
+
+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:**
+
+<pre>
+<strong>Input:</strong> nums = [1,1,0,1]
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> After deleting the number in position 2, [1,1,1] contains 3 numbers with value of 1's.
+</pre>
+
+### **Example 2:**
+
+<pre>
+<strong>Input:</strong> nums = [0,1,1,1,0,1,1,0,1]
+<strong>Output:</strong> 5
+<strong>Explanation:</strong> 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].
+</pre>
+
+### **Example 3:**
+
+<pre>
+<strong>Input:</strong> nums = [1,1,1]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> You must delete one element.
+</pre>
+
+### **Constraints:**
+
+- <code>1 <= nums.length <= 10<sup>5</sup></code>
+- `nums[i]` is either `0` or `1`.

solutions/solution_1493/__init__.py

@@ -0,0 +1,6 @@
+from typing import List
+
+
+class Solution:
+    def longestSubarray(self, nums: List[int]) -> int:
+        ...

solutions/solution_1493/test_solution.py

@@ -0,0 +1,45 @@
+from typing import TypedDict
+
+import pytest
+
+from . import Solution
+
+
+class InputDict(TypedDict):
+    nums: list[int]
+
+
+class CaseDict(TypedDict):
+    input: InputDict
+    expected: int
+
+
+test_cases: list[CaseDict] = [
+    {
+        "input": {
+            'nums': [1, 1, 0, 1],
+        },
+        "expected": 3,
+    },
+    {
+        "input": {
+            'nums': [0, 1, 1, 1, 0, 1, 1, 0, 1],
+        },
+        "expected": 5,
+    },
+    {
+        "input": {
+            'nums': [1, 1, 1],
+        },
+        "expected": 2,
+    },
+]
+
+
+@pytest.mark.parametrize(
+    'test_case',
+    test_cases,
+)
+def test_solution(test_case: CaseDict):
+    result = Solution().longestSubarray(**test_case["input"])
+    assert result == test_case["expected"]