source: https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/description/ Table of ContentsLongest Subarray of 1’s After Deleting One ElementDescriptionExample 1:Example 2:Example 3:Constraints:Solution Longest Subarray of 1’s After Deleting One Element Description 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 ...