Subarray sum in range
Given an integer array nums and two integers lower and upper, count the number of contiguous subarrays whose sum lies in the inclusive range [lower, upper]. The array may contain negatives and zeros and can be empty. Return the count.
Implement
count_range_sum(nums: list[int], lower: int, upper: int) → intExamples
in
[[-2,5,-1],-2,2]out3What 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 45 min
solution.py
InputExpectedGot
[[-2,5,-1],-2,2]3not run yetsample