Max sum subarray by removing at most one element

Sumit Rawal answered on October 19, 2022 Popularity 4/10 Helpfulness 2/10

answer Max sum subarray by removing at most one element

Max sum subarray by removing at most one element

Comment

/*Complete the function below*/


class Solution
{
    //Function to return maximum sum subarray by removing at most one element.
   
    public static int maxSumSubarray(int[] arr,int n) {
        // SUPER INTUTIVE LOGIC FOR ALL SAWAL 
        // INCLUDING DELETION OR REPLACEMENT OR ANY
        // ANOTHER THING WITH MAX SUM SUBARRAY !!
        int max=arr[0];
        int[] csNodeletion=new int[arr.length];    
        int[] csOnedeletion=new int[arr.length];
        csNodeletion[0]=arr[0];
        for(int i=1;i<arr.length;i++){
            csNodeletion[i]=(int)Math.max(arr[i],csNodeletion[i-1]+arr[i]);
            csOnedeletion[i]=(int)Math.max(csNodeletion[i-1],csOnedeletion[i-1]+arr[i]);
            // Onedeletion means one deletion till now 
            max=Math.max(csNodeletion[i],max);
            max=Math.max(csOnedeletion[i],max);
        }
        
        
        return max;
        
    }
    
}

Popularity 4/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: element max sub-array sum whatever

Link to this answer
Share Copy Link

Contributed on Oct 19 2022

Sumit Rawal

0 Answers Avg Quality 2/10

Max sum subarray by removing at most one element

Contents

More Related Answers

Max sum subarray by removing at most one element

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.