Minimum length subarray with sum
Given an array a of positive integers and a positive integer target, return the minimal length of a contiguous subarray whose sum is >= target. If no such subarray exists, return 0.
Implement
min_len_subarray_sum(a: list[int], target: int) → intExamples
in
[[2,3,1,2,4,3],7]out2What 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 20 min
solution.py
InputExpectedGot
[[2,3,1,2,4,3],7]2not run yetsample