Skip to content

Files

Latest commit

d999fae · Apr 21, 2020

History

History

problem049

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Apr 21, 2020
Apr 21, 2020
Apr 21, 2020

Daily Coding Problem: Problem #49

Good morning! Here's your coding interview problem for today.

This problem was asked by Amazon.

Given an array of numbers, find the maximum sum of any contiguous subarray of the array.

For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.

Given the array [-5, -1, -8, -9], the maximum sum would be 0, since we would not take any elements.

Do this in O(N) time.