Question

Maximum subarray sum problem is to find the subarray with maximum sum. For example

Answer 1

Explanation:

You are given a one dimensional array that may contain both positive and negative integers, find the sum of contiguous subarray of numbers which has the largest sum.

✍✍✍✍✍For example, if the given array is {-2, -5, 6, -2, -3, 1, 5, -6}, then the maximum subarray sum is 7 (see highlighted elements).

Answer 2

hello!

____

find the sum of contiguous subarray of numbers which has the largest sum.

For example:-

if the given array is 2 -5 6 -2 -3 1 5 -6 then the maximum subarray sum is 7 see highlighted elements.