How should I practice Subarray Sum Equals K?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google phone screen problems in FastPrep.

Is Subarray Sum Equals K associated with Google?

FastPrep tags this as a Google phone screen coding practice problem when the problem catalog has that company and stage context.

Google● MediumNEW GRADPHONE SCREEN

Given an integer array nums and an integer k, return the number of nonempty contiguous subarrays whose sum equals k.

Return the exact count as a signed 64-bit integer.

countSubarraysWithSum(nums: int[], k: int) → long

nums = [1,1,1]k = 2return = 2

The first two and last two elements each sum to 2.

nums = [1,2,3]k = 3return = 2

Subarrays [1,2] and [3] qualify.

nums = [1,-1,0]k = 0return = 3

[1,-1], [0], and the whole array sum to zero.