Snippets Collections
int flipBits(int* arr, int n) 
{  int count = 0;
   for(int i = 0; i<n; i++){
       if(arr[i] == 1){
           count++;
       }
   }
 int sum = 0;
 int max = 0;
   for(int i = 0; i<n; i++){
       if(arr[i] == 0){
         sum++;
           
       }else{
           sum--;
       }
    
       if(sum < 0){
           sum = 0;
       }
       if(sum > max){
          max = sum;
       }
   }
 
 return count + max;
}
star

Sat Jul 30 2022 09:31:05 GMT+0000 (Coordinated Universal Time) https://www.codingninjas.com/codestudio/guided-paths/data-structures-algorithms

#kadene #c++

Save snippets that work with our extensions

Available in the Chrome Web Store Get Firefox Add-on Get VS Code extension