Longest Subarray of 1's After Deleting One Element

Medium

sliding-windowarray

Given a binary array nums, you must delete exactly one element. Return the length of the longest run of 1s in the resulting array.

Input: one line of space-separated 0/1 integers. Output: the maximum length (0 if none).

Example 1

Input:

1 1 0 1

Output:

Delete the 0 → [1,1,1].

Example 2

Input:

0 1 1 1 0 1 1 0 1

Output:

Delete the middle 0 → run of 5.

Example 3

Input:

1 1 1

Output:

You must delete something.

Run your code against the sample tests, or Submit to run the full suite.

Medium

sliding-windowarray

Given a binary array nums, you must delete exactly one element. Return the length of the longest run of 1s in the resulting array.

Input: one line of space-separated 0/1 integers. Output: the maximum length (0 if none).

Example 1

Input:

1 1 0 1

Output:

Delete the 0 → [1,1,1].

Example 2

Input:

0 1 1 1 0 1 1 0 1

Output:

Delete the middle 0 → run of 5.

Example 3

Input:

1 1 1

Output:

You must delete something.

Run your code against the sample tests, or Submit to run the full suite.