diff --git a/leetcode/maximum_subarray.cpp b/leetcode/maximum_subarray.cpp
new file mode 100644
index 00000000..b4dccc6c
--- /dev/null
+++ b/leetcode/maximum_subarray.cpp
@@ -0,0 +1,17 @@
+class Solution {
+public:
+    int maxSubArray(vector<int>& nums) {
+        int sum = nums[0], result = nums[0];
+        
+        if(nums.size() == 1)
+            return result;
+        
+        for(int i = 1; i <= nums.size() - 1; i++)
+        {
+            sum = max(nums[i], sum + nums[i]);
+            //por ex: [-2, -1] max(-1, (-2-1)) => max(-1, -3) = -1
+            result = max(sum, result);
+        }
+        return result;
+    }
+};