Solution Review: Finding the Largest Sum Subarray
Let’s take a detailed look at the previous challenge’s solution.
We'll cover the following
Solution
-
In a single scan, the maximum subarray in an array is discovered. We keep track of the maximum sum till the current element and the global maximum sum so far.
-
We change the global maximum value when we discover that it is smaller than the current sum.
-
Finally, we return the global maximum value.
Solution Code
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.