Maximum length of subarray with non-zero elements

Problem solving with programming: Maximum length of subarray with non-zero elements

Given an array of of size N, How do we find the longest sub-array with all non-zero elements?

max_len = 0


current_len = 0


index = 0


 


while index < n:


if num_list[index] == 0:


max_len = max(max_len,current_len)


current_len = 0


else:


current_len += 1


index += 1


 


max_len = max( max_len, current_len)

Read full article from Problem solving with programming: Maximum length of subarray with non-zero elements