<p><strong>Question</strong></p>
<p>Given an integer array <code>nums</code>, find the </p>
<p>subarray</p>
<p> with the largest sum, and return <em>its sum</em>.</p>
<p><img src="https://cdn.buymeacoffee.com/uploads/project_updates/2023/01/89918025113d4f9a95102d972e46a436.png" alt /></p>
<h3 id="heading-leetcode-java-solution"><strong>Leetcode Java Solution</strong></h3>
<p><img src="https://cdn.buymeacoffee.com/uploads/project_updates/2023/01/d206bec7d69a491a657fffd05e279997.png" alt /></p>
<h3 id="heading-leetcode-c-solution"><strong>Leetcode C++ Solution</strong></h3>
<p><img src="https://cdn.buymeacoffee.com/uploads/project_updates/2023/01/5b4974048e270b9fb7d2b81bc02c89af.png" alt /></p>
<p><strong>Source:</strong></p>
<p><a target="_blank" href="https://youtu.be/1NZTcXoVyRg">https://youtu.be/1NZTcXoVyRg</a></p>
<iframe src="https://www.youtube.com/embed/1NZTcXoVyRg" class="note-video-clip" width="640" height="360" style="box-sizing:border-box;--tw-border-spacing-x:0;--tw-border-spacing-y:0;--tw-translate-x:0;--tw-translate-y:0;--tw-rotate:0;--tw-skew-x:0;--tw-skew-y:0;--tw-scale-x:1;--tw-scale-y:1;--tw-pan-x: ;--tw-pan-y: ;--tw-pinch-zoom: ;--tw-scroll-snap-strictness:proximity;--tw-ordinal: ;--tw-slashed-zero: ;--tw-numeric-figure: ;--tw-numeric-spacing: ;--tw-numeric-fraction: ;--tw-ring-inset: ;--tw-ring-offset-width:0px;--tw-ring-offset-color:#fff;--tw-ring-color:#3b82f680;--tw-ring-offset-shadow:0 0 #0000;--tw-ring-shadow:0 0 #0000;--tw-shadow:0 0 #0000;--tw-shadow-colored:0 0 #0000;--tw-blur: ;--tw-brightness: ;--tw-contrast: ;--tw-grayscale: ;--tw-hue-rotate: ;--tw-invert: ;--tw-saturate: ;--tw-sepia: ;--tw-drop-shadow: ;--tw-backdrop-blur: ;--tw-backdrop-brightness: ;--tw-backdrop-contrast: ;--tw-backdrop-grayscale: ;--tw-backdrop-hue-rotate: ;--tw-backdrop-invert: ;--tw-backdrop-opacity: ;--tw-backdrop-saturate: ;--tw-backdrop-sepia: ;width:574px;margin-bottom:24px;color:rgb(34, 34, 34);font-family:"></iframe>

<h1 id="heading-get-involved"><strong>Get involved</strong></h1>
<ul>
<li><p><a target="_blank" href="https://www.youtube.com/channel/UCdbUomS4yFXN9D3_ZLtJJUg">Subscribe to me on youtube</a></p>
</li>
<li><p><a target="_blank" href="https://twitter.com/alwayslaxmikant">Follow on Twitter</a></p>
</li>
<li><p><a target="_blank" href="https://www.buymeacoffee.com/mcode">Buy me a coffee</a></p>
</li>
<li><p><a target="_blank" href="https://github.com/sponsors/mcode8">Sponsor me</a></p>
</li>
</ul>


**Question**

Given an integer array `nums`, find the 

subarray

 with the largest sum, and return *its sum*.

![](https://cdn.buymeacoffee.com/uploads/project_updates/2023/01/89918025113d4f9a95102d972e46a436.png align="left")

### **Leetcode Java Solution**

![](https://cdn.buymeacoffee.com/uploads/project_updates/2023/01/d206bec7d69a491a657fffd05e279997.png align="left")

### **Leetcode C++ Solution**

![](https://cdn.buymeacoffee.com/uploads/project_updates/2023/01/5b4974048e270b9fb7d2b81bc02c89af.png align="left")

**Source:**

[https://youtu.be/1NZTcXoVyRg](https://youtu.be/1NZTcXoVyRg)

<iframe src="https://www.youtube.com/embed/1NZTcXoVyRg" class="note-video-clip" width="640" height="360" style="box-sizing:border-box;--tw-border-spacing-x:0;--tw-border-spacing-y:0;--tw-translate-x:0;--tw-translate-y:0;--tw-rotate:0;--tw-skew-x:0;--tw-skew-y:0;--tw-scale-x:1;--tw-scale-y:1;--tw-pan-x: ;--tw-pan-y: ;--tw-pinch-zoom: ;--tw-scroll-snap-strictness:proximity;--tw-ordinal: ;--tw-slashed-zero: ;--tw-numeric-figure: ;--tw-numeric-spacing: ;--tw-numeric-fraction: ;--tw-ring-inset: ;--tw-ring-offset-width:0px;--tw-ring-offset-color:#fff;--tw-ring-color:#3b82f680;--tw-ring-offset-shadow:0 0 #0000;--tw-ring-shadow:0 0 #0000;--tw-shadow:0 0 #0000;--tw-shadow-colored:0 0 #0000;--tw-blur: ;--tw-brightness: ;--tw-contrast: ;--tw-grayscale: ;--tw-hue-rotate: ;--tw-invert: ;--tw-saturate: ;--tw-sepia: ;--tw-drop-shadow: ;--tw-backdrop-blur: ;--tw-backdrop-brightness: ;--tw-backdrop-contrast: ;--tw-backdrop-grayscale: ;--tw-backdrop-hue-rotate: ;--tw-backdrop-invert: ;--tw-backdrop-opacity: ;--tw-backdrop-saturate: ;--tw-backdrop-sepia: ;width:574px;margin-bottom:24px;color:rgb(34, 34, 34);font-family:"Circular Regular", sans-serif;font-size:16px;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-weight:400;letter-spacing:normal;orphans:2;text-align:start;text-indent:0px;text-transform:none;white-space:normal;widows:2;word-spacing:0px;-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);text-decoration-thickness:initial;text-decoration-style:initial;text-decoration-color:initial"></iframe>

# **Get involved**

* [Subscribe to me on youtube](https://www.youtube.com/channel/UCdbUomS4yFXN9D3_ZLtJJUg)
    
* [Follow on Twitter](https://twitter.com/alwayslaxmikant)
    
* [Buy me a coffee](https://www.buymeacoffee.com/mcode)
    
* [Sponsor me](https://github.com/sponsors/mcode8)

Question

Given an integer array nums, find the

subarray

with the largest sum, and return its sum

Leetcode solution java | c++ 53Maximum Subarray

Table of contents

Leetcode Java Solution

Leetcode C++ Solution

Get involved