Subarray Sum Coding | Dataford Interview Questions

Virtusa delivery analytics may need to count contiguous windows of event values that meet an exact threshold. Given an integer array and a target, return the number of non-empty contiguous subarrays whose elements sum to the target.

Use an algorithm efficient enough for arrays containing up to 100,000 values. Values may be positive, zero, or negative.

Formal Specification

Implement subarray_sum_count(nums, target).

Input: nums, a list of integers, and target, an integer.
Output: An integer representing the number of non-empty contiguous subarrays whose sum equals target.
A subarray must contain consecutive elements, and different index ranges count separately even when they contain the same values.

Constraints

1 <= nums.length <= 100,000
-10,000 <= nums[i] <= 10,000
-10^9 <= target <= 10^9
The result may be as large as O(n^2)

Function Signature

def subarray_sum_count(nums, target):

Your question is Subarray Sum Coding. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem