Problem
Given an array of integers representing resource demands, find the maximum sum of a contiguous subarray using an optimal time complexity.
You are practicing as a guest. Sign up free to get your answer graded with AI feedback. Your draft stays right here.
