Maximum Contiguous Subarray Sum

Asked at Google · Coding Questions · Difficulty: Medium

You are given a list of integers that may include negative values. Find the contiguous block of the list whose elements add up to the largest total, and return that total together with the block's first and last index.

Loading the problem…