max subsequence sum in array

Add Answer

Eager Eagle answered on September 14, 2020 Popularity 10/10 Helpfulness 2/10

answer max subsequence sum in array

related find maximum sum in array of contiguous subarrays

related Maximum Subarray sum

related maximum sum subarray

related Maximum subarray sum

max subsequence sum in array

Comments(1)

def max_subarray(numbers):
    """Find the largest sum of any contiguous subarray."""
    best_sum = 0  # or: float('-inf')
    current_sum = 0
    for x in numbers:
        current_sum = max(0, current_sum + x)
        best_sum = max(best_sum, current_sum)
    return best_sum

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: max subsequence sum whatever

Link to this answer
Share Copy Link

Contributed on Sep 14 2020

Eager Eagle

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

Maximum Subarray sum

Comments(1)

 def maxSubArray(self, nums: List[int]) -> int:
        curr_best = overall_best =  nums[0]
        for i in range(1,len(nums)):
            if curr_best>=0:
                curr_best = curr_best + nums[i]
            else:
                curr_best = nums[i]
            if curr_best > overall_best:
                overall_best = curr_best
        return overall_best

Popularity 10/10 Helpfulness 2/10 Language python

Source: Grepper

Tags: python py

Link to this answer
Share Copy Link

Contributed on May 20 2022

Combative Cardinal

0 Answers Avg Quality 2/10

maximum sum subarray

Comment

def max_subarray_sum(arr):
    max_sum = float('-inf')
    curr_sum = 0
    start = end = 0
    
    for i in range(len(arr)):
        curr_sum += arr[i]
        
        if curr_sum > max_sum:
            max_sum = curr_sum
            end = i
        if curr_sum < 0:
            curr_sum = 0
            start = i + 1
            
    subarray = arr[start:end+1]
    return subarray, max_sum

# Example usage
arr = [-2, -3, 4, -1, -2, 1, 5, -3]
subarray, max_sum = max_subarray_sum(arr)
print("Subarray with maximum sum:", subarray)
print("Maximum sum:", max_sum)

Popularity 9/10 Helpfulness 2/10 Language python

Source: Grepper

Link to this answer
Share Copy Link

Contributed on Sep 11 2023

YOU.com

0 Answers Avg Quality 2/10

maximum sum subarray

Comment

public static int SumArray()
{
    var arr = new int[]{ -2, -4, -5, -6, -7, -89, -56 };
    var sum = 0;
    var max = arr[0];
    foreach (var item in arr)
    {
        sum += item;
      // sum = Math.Max(sum,0); resting here will not give  expected output
        max = Math.Max(sum,max);
        sum = Math.Max(sum,0);
    }
    return max;
}

Popularity 10/10 Helpfulness 2/10 Language csharp

Source: Grepper

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Mar 01 2022

PrashantUnity

0 Answers Avg Quality 2/10

Maximum subarray sum

Comment

var maxSequence = function(arr){
  var min = 0, ans = 0, i, sum = 0;
  for (i = 0; i < arr.length; ++i) {
    sum += arr[i];
    min = Math.min(sum, min);
    ans = Math.max(ans, sum - min);
  }
  return ans;
}

Popularity 10/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Jun 21 2022

ABS

0 Answers Avg Quality 2/10

max subsequence sum in array

Contents

More Related Answers

max subsequence sum in array

Closely Related Answers

find maximum sum in array of contiguous subarrays

Maximum Subarray sum

maximum sum subarray

maximum sum subarray

Maximum subarray sum

Grepper

Documentation

Social

Legal

Contact

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