🔥 Maximum Subarray

Author: maddhruv

README.md

@@ -4,9 +4,10 @@ Solutions of LeetCode Blind 75 Problems in JavaScript
 
 :goal_net: [Curated List of Top 75 LeetCode Questions](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU)
 
-| Problem                                                                 | Difficulty                                                | Tags                                    | LeetCode                                                                 |
-| ----------------------------------------------------------------------- | --------------------------------------------------------- | --------------------------------------- | ------------------------------------------------------------------------ |
-| [Two Sum](./two-sum.js)                                                 | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Hash Table`                   | [:link:](https://leetcode.com/problems/two-sum/)                         |
-| [Best Time to Buy and Sell Stock](./best-time-to-buy-and-sell-stock.js) | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Dynamic Programming`          | [:link:](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) |
-| [Contains Duplicate](./contains-duplicate.js)                           | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Set`, `Sorting`, `Hash Table` | [:link:](https://leetcode.com/problems/contains-duplicate/)              |
-| [Product of Array Except Self](./product-of-array-except-self.js)       | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`                                 | [:link:](https://leetcode.com/problems/product-of-array-except-self/)    |
+| Problem                                                                 | Difficulty                                                | Tags                                               | LeetCode                                                                 |
+| ----------------------------------------------------------------------- | --------------------------------------------------------- | -------------------------------------------------- | ------------------------------------------------------------------------ |
+| [Two Sum](./two-sum.js)                                                 | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Hash Table`                              | [:link:](https://leetcode.com/problems/two-sum/)                         |
+| [Best Time to Buy and Sell Stock](./best-time-to-buy-and-sell-stock.js) | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Dynamic Programming`                     | [:link:](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) |
+| [Contains Duplicate](./contains-duplicate.js)                           | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Set`, `Sorting`, `Hash Table`            | [:link:](https://leetcode.com/problems/contains-duplicate/)              |
+| [Product of Array Except Self](./product-of-array-except-self.js)       | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`                                            | [:link:](https://leetcode.com/problems/product-of-array-except-self/)    |
+| [Maximum Subarray](./maximum-subarray.js)                               | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Dynamic Programming`, `Divide & Conquer` | [:link:](https://leetcode.com/problems/maximum-subarray/)                |

maximum-subarray.js

@@ -0,0 +1,13 @@
+const maxSubArray = (nums) => {
+  let max = nums[0],
+    current = 0;
+
+  for (let num of nums) {
+    if (current < 0) current = 0;
+    current += num;
+
+    max = Math.max(max, current);
+  }
+
+  return max;
+};