Challenge
Challenge
Problem
Solutions
Submissions
Challenge Points: 10
Level: EasyYou are given an array nums consisting only of 0s and 1s.
Your task is to determine the length of the longest continuous sequence of 1s present in the array.
You must scan through the array and find the maximum number of consecutive 1s that appear without any 0 interrupting the sequence.
Input: nums = [1, 1, 1, 0, 1, 1]
Output: 3
Input: nums = [0, 1, 1, 1, 1, 0, 1]
Output: 4
Accepted:
Submission:
Report an issue
Code
You need toto run or submitYou need toto run or submit
Test Case
Test Result