Your question is Maximum Sum Contiguous Subarray. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
On a Meta surface such as Facebook Feed analytics, you are given an integer array representing per-minute engagement deltas. Find the contiguous subarray with the largest possible sum, and return that sum along with the start and end indices of one optimal subarray.
Implement a function that takes a non-empty list of integers nums and returns a list [max_sum, start_index, end_index].
nums: List[int]List[int]
max_sum: maximum sum over all contiguous subarraysstart_index: starting index of one maximum-sum subarrayend_index: ending index of that subarrayIf multiple subarrays have the same maximum sum, returning any one of them is acceptable.
def max_subarray(nums):