Breaking News: Grepper is joining You.com. Read the official announcement!

Largest Sum Contiguous Subarray in Range

Add Answer

Sumit Rawal answered on September 9, 2021 Popularity 8/10 Helpfulness 1/10

answer Largest Sum Contiguous Subarray in Range

related find maximum sum in array of contiguous subarrays

related Largest sum contiguous subarray

related largest subarray with sum 0

Largest Sum Contiguous Subarray in Range

Comment



static void update(int arr[], int arrSize, int index, int value)
{
   // Your code here
   arr[index-1]=value;
}

//Funciton to return the Maximum-Sum in the range.
static int query(int arr[], int n, int left, int right) 
{
   // code here
    int curr=arr[left-1];
       int sum=arr[left-1];
       for (int i=left;i<right;i++){
           sum=Math.max(arr[i], sum+arr[i]);
           curr=Math.max(curr,sum);
       }
       return curr;
}

Popularity 8/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: contiguous range sub-array sum whatever

Link to this answer
Share Copy Link

Contributed on Oct 18 2022

Sumit Rawal

0 Answers Avg Quality 2/10

Closely Related Answers

find maximum sum in array of contiguous subarrays

Comment

#include <iostream>

using namespace std;

int main(){
    //Input Array
    int n;
    cin >> n;
    int arr[n];
    for(int i =0;i< n;i++){
    cin >> arr[i];
    }

    int currentSum = 0;
    int maxSum = INT_MIN;
    //algo
    for (int i = 0; i < n; i++)
    {
        currentSum += arr[i];
        if (currentSum <0)
        {
            currentSum = 0;
        }
        maxSum = max(maxSum, currentSum);
    }
    cout << maxSum << endl;

    return 0;
}

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Sep 09 2021

baba

0 Answers Avg Quality 2/10

Largest sum contiguous subarray

Comment

// Java program to print largest 
// contiguous array sum
class GFG {
  
    static void maxSubArraySum(int a[], int size)
    {
        int max_so_far = Integer.MIN_VALUE,
        max_ending_here = 0,start = 0,
        end = 0, s = 0;
  
        for (int i = 0; i < size; i++) 
        {
            max_ending_here += a[i];
  
            if (max_so_far < max_ending_here) 
            {
                max_so_far = max_ending_here;
                start = s;
                end = i;
            }
  
            if (max_ending_here < 0) 
            {
                max_ending_here = 0;
                s = i + 1;
            }
        }
        System.out.println("Maximum contiguous sum is " 
                           + max_so_far);
        System.out.println("Starting index " + start);
        System.out.println("Ending index " + end);
    }
  
    // Driver code
    public static void main(String[] args)
    {
        int a[] = { -2, -3, 4, -1, -2, 1, 5, -3 };
        int n = a.length;
        maxSubArraySum(a, n);
    }
}
  
// This code is contributed by  prerna saini

Popularity 10/10 Helpfulness 1/10 Language java

Source: www.geeksforgeeks.org

Tags: contiguous c

Link to this answer
Share Copy Link

Contributed on Aug 24 2022

Golu Rawat

0 Answers Avg Quality 2/10

largest subarray with sum 0

Comment

Input:
N = 8
A[] = {15,-2,2,-8,1,7,10,23}
Output: 5
Explanation: The largest subarray with
sum 0 will be -2 2 -8 1 7.

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: practice.geeksforgeeks.org

Tags: sub-array sub-

Link to this answer
Share Copy Link

Contributed on Dec 15 2021

Morwal

0 Answers Avg Quality 2/10

Largest Sum Contiguous Subarray in Range

Contents

More Related Answers

Largest Sum Contiguous Subarray in Range

Closely Related Answers

find maximum sum in array of contiguous subarrays

Largest sum contiguous subarray

largest subarray with sum 0

Grepper

Documentation

Social

Legal

Contact

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