Challenge: Finding the Largest Sum Subarray
Explore how to find the contiguous subarray that has the maximum sum within an integer array. Understand the problem and attempt efficient techniques beyond brute force to improve algorithm performance in Go.
We'll cover the following...
We'll cover the following...
Problem
Given an array of positive and negative integers, find a contiguous subarray whose sum (sum of its elements) is the maximum.
Input
An integer array. ...