Given a binary array nums, remove exactly one element from it. Return the length of the longest non-empty subarray consisting entirely of $1$'s in the resulting array. If no such subarray exists, return $0$.

Note: Exactly one element must always be deleted, even if all elements are $1$'s.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• nums[i] is either $0$ or $1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.