Maximum Subarray

medium Points: 100

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.

Constraints

  • 1 ≤ n ≤ 105
  • Input is a list of integers

Examples

Input: [2, 7, 11, 15], target = 9
Output: [0, 1]
Solve Now Ask an Expert

Need Help?

Connect with expert programmers on CodeConnect for real-time collaborative coding, video meetings, and whiteboard sessions.