Graph Theory Challenge

4 problems · Live · No discussion until contest ends

45:00
A B C D

A. Maximum Subarray Energy

Medium
DPKadane

You are given an array of integers representing energy cells. Find the contiguous subarray with the largest sum and return that maximum energy. The subarray must contain at least one element.

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

Constraints

  • • 1 <= nums.length <= 10^5
  • • -10^4 <= nums[i] <= 10^4
contest.js⚠ Strict mode · tab-switch is logged
Loading...
Language: JavaScript (Node 20)