CPP
CPP copied to clipboard
MAXIMUM SUBARRAY
Description Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6. Example 2:
Input: nums = [1] Output: 1
@akshitagit can I work on this program for this Hacktober fest?
@akshitagit can I work on this program for this Hacktober fest?
Looks a simple issue. Assign it to me @utchak160
I have done this. Please assign this to me!
I want to work on this issue
Hi, can I work on this issue for Hacktober fest?
can i work on this issue ?
I'm a beginner and want to work on this issue. Can you please assign it to me?