class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& arr) {
        int maxcount =0;
        int count =0;
        int n = arr.size();

        for(int i =0 ; i< n; i++){
            if(arr[i]== 1){
                count++; 
                maxcount = max(maxcount , count);
            }else{
                count=0;
            }
        }
        return maxcount;
    }
};

https://leetcode.com/problems/max-consecutive-ones/

https://takeuforward.org/data-structure/count-maximum-consecutive-ones-in-the-array/