Hello coders, Today we will see another Leetcode problem that is ” **Maximum Subarray Leetcode Solution** “. This problem is also a variance of subset sum problem.

Let’s first see the problem statement.

## Problem statement:

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.

**Example 1:**

Input:nums = [-2,1,-3,4,-1,2,1,-5,4]Output:6Explanation:[4,-1,2,1] has the largest sum = 6.

**Example 2:**

Input:nums = [1]Output:1

**Example 3:**

Input:nums = [5,4,-1,7,8]Output:23

## Maximum Subarray Leetcode Solution in python

#Maximum Subarray Leetcode Solution class Solution: def maxSubArray(self, nums: List[int]) -> int: result = nums[0] sum = 0 for i in range(len(nums)): sum = max(nums[i], sum + nums[i]); result =max(result, sum); return result #Maximum Subarray Leetcode Solution

**Disclaimer:** This problem(**Maximum Subarray Leetcode solution**) is originally created by Leetcode. Codesagar only provides a solution for it. This solution is only for Educational and learning purposes.