Maximum subarray sum
Given an integer array, return the largest sum of any contiguous subarray (at least one element).
Implement
max_subarray(nums: list[int]) → intExamples
in
[[-2,1,-3,4,-1,2,1,-5,4]]out6What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 15 min
solution.py
InputExpectedGot
[[-2,1,-3,4,-1,2,1,-5,4]]6not run yetsample