lec_28.cpp

class Solution {
    public:
        int findMaxConsecutiveOnes(vector<int>& arr) {
            int maxi = 0;
    
            int n = arr.size();
          
            int count = 0 ;
            for(int i = 0 ;i<n;i++){
                
                if(arr[i] == 1){
                    count++;
                    maxi = max(maxi , count);
                }else{
                    count =0;
                }
            }
    
            return maxi;
        }
    };