Max Consecutive Ones · Interview Problem

Leetcode

max-consecutive-ones

Easy

Arrays

Counting

Max Consecutive Ones

Find the maximum number of consecutive 1s in a binary array.

Acceptance 100%

Also Available On

Other platform versions and source mappings for the same problem.

Maximum Consecutive Ones

gfg

Problem Statement

Core description from the backend problem record.

Given a binary array, find the maximum number of consecutive 1s in the array.

An array of integers nums containing only 0s and 1s.

An integer representing the maximum number of consecutive 1s in the array.

1 <= nums.length <= 10^5 nums[i] is either 0 or 1.

Examples

Sample cases returned by the problem API.

Example 1

Input

[1,1,0,1,1,1]

Output

Explanation

The longest run of 1s is three.

Loading Preptin