# LeetCode: Maximum Ascending Subarray Sum Solution

1/**2 * @param {number[]} nums3 * @return {number}4 */5var maxAscendingSum = function (nums) {6 const N = nums.length7 let sum = nums[0]8 let max = sum9 for (let i = 1; i < N; i++) {10 if (nums[i] <= nums[i - 1]) {11 sum = 012 }13 sum += nums[i]14 max = Math.max(max, sum)15 }16 return max17}

## Comments

Loading comments...

## Tags

leetcode

array

## Apply and earn a $2,500 bonus once you're hired on your first job!

Clients from the Fortune 500 to Silicon Valley startups

Choose your own rate, get paid on time

From hourly, part-time, to full-time positions

Flexible remote working environment

A lot of open JavaScript jobs!!

**Fact corner:** Referred talent are 5x more likely to pass the Toptal screening process than the average applicant.

**Still hesitate?** Read HoningJS author's guide on dealing with Toptal interview process.

## Next Post

LeetCode: Design Authentication Manager

Mar 21, 2021

## Previous Post

LeetCode: Number Of Orders In The Backlog

Mar 21, 2021