Longest Subarray of 1's After Deleting One Element at Yandex
Medium71.0% acceptance
This problem has 100.0% frequency at Yandex.
Problem 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 is no such subarray.
Read full problem and hintsTopics
Also asked at 7 companies
More Yandex Questions
Longest Substring Without Repeating CharactersMediumSummary RangesEasyFind K Closest ElementsMediumMaximize Distance to Closest PersonMediumTwo SumEasy
View all Yandex questions