# Maximum Subarray

{% embed url="<https://leetcode.com/problems/maximum-subarray>" %}

### Problem

> Given an integer array `nums`, find the subarray which has the largest sum and return *its sum*.
>
> &#x20;
>
> **Example 1:**
>
> <pre><code>Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
> <strong>Output: 6
> </strong><strong>Explanation: [4,-1,2,1] has the largest sum = 6.
> </strong></code></pre>
>
> **Example 2:**
>
> <pre><code>Input: nums = [1]
> <strong>Output: 1
> </strong></code></pre>
>
> **Example 3:**
>
> <pre><code>Input: nums = [5,4,-1,7,8]
> <strong>Output: 23
> </strong></code></pre>

### Pseudocode

{% code overflow="wrap" %}

```
- add up numbers in sequence
 - if previous + current number < previous, retain previous.
 - then compare Math.max(previous, maxSum)
```

{% endcode %}

### Solution

```javascript
var maxSubArray = function(nums) {
    let max = - Infinity
    let prev = 0

    for(let i = 0; i < nums.length; i++) {
        let curr = nums[i];

        prev = Math.max(curr, curr + prev)
        max = Math.max(prev, max);
    }

    return max
};
```

### Time and Space Complexity

#### Time

* Iterate thorugh nums array - O(N)
* Total - O(N)

#### Space

* Storing summation values, previous and maximum - O(1)
* Total - O(1)


---

# 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://grind75-notes.gitbook.io/notes/week-2/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.