# 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 %}


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://blog.bernardw.com/problems/maximum-subarray.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.