terminal
Elevo
code
Topics
corporate_fare
Companies
history
History
arrow_back Back to Challenges

#53 Maximum Subarray

Medium Acceptance 0%
Editorial
description

Problem Description

Given an integer array `nums`, find the subarray with the largest sum, and return its sum.

checklist Constraints

1 <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4

science Examples

Case #1

In: nums = [-2,1,-3,4,-1,2,1,-5,4]
Out: 6

Case #2

In: nums = [1]
Out: 1

Mastery Tags

Arrays Dynamic Programming

Hiring Companies

Amazon Google Microsoft
code

Integrated IDE

Login to Compile
code_blocks
Coding
psychology
Aptitude