This problem was asked by Twitter.
You are given an array of integers. Find the maximum sum of all possible contiguous subarrays of the array.
Your solution should run in linear time.
Input: [34, -50, 42, 14, -5, 86]
Output: 137 ([42, 14, -5, 86])
challenge-43
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||