Longest subarray sum equals target
Given a list of integers (positive, zero, or negative) and a target k, return the length of the longest contiguous run of elements whose sum is exactly k. Return 0 if no such run exists. Runs must be non-empty. Example: nums = [1, -1, 5, -2, 3], k = 3 gives 4, because 1 + (-1) + 5 + (-2) = 3 is the longest qualifying run.
Implement
longest_run_with_sum(nums: list[int], k: int) → intExamples
in
[[1,-1,5,-2,3],3]out4What 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 16 min
solution.py
InputExpectedGot
[[1,-1,5,-2,3],3]4not run yetsample