# Maximum Subarray


## 🧠 Problem

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. A subarray is a contiguous part of an array.

---

### 🏷️ Tags  
`Array,Divide and Conquer,Dynamic Programming`

---

### 📊 Difficulty  
**Easy**

✅ Success Rate: **49.5%**  
📥 Submissions: **4,544,146**  
📈 Accepted: **2,249,144**

---

### ❤️ Reactions  
👍 Likes: **19877**  
👎 Dislikes: **969**

---

### 💡 Hints



---

### 🔁 Similar Questions

- Best Time to Buy and Sell Stock
- Maximum Product Subarray
- Degree of an Array
- Longest Turbulent Subarray
- Maximum Absolute Sum of Any Subarray
- Maximum Subarray Sum After One Operation