> For the complete documentation index, see [llms.txt](https://blog.bernardw.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://blog.bernardw.com/problems/maximum-subarray.md).

# Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array

> \[-2,1,-3,4,-1,2,1,-5,4],

the contiguous subarray

> \[4,-1,2,1]

has the largest sum = 6.

{% tabs %}
{% tab title="Scala" %}

```scala
def maxSubArray(nums: Array[Int]): Int = {
  var sum = nums.head
  var maxSum = nums.head
  for (i <- nums) {
    sum = i max sum + i
    maxSum = sum max maxSum
  }
  maxSum
}

val nums = Array(-2, 1, -3, 4, -1, 2, 1, -5, 4)
maxSubArray(nums)
```

{% endtab %}

{% tab title="Second Tab" %}

{% endtab %}
{% endtabs %}