How should I practice Count Subarrays With Target Sum?

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

Is Count Subarrays With Target Sum associated with Amazon?

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

Problem · Array

● Medium

AmazonFULLTIMEPHONE SCREEN

Given an integer array nums and an integer target, return the number of non-empty contiguous subarrays whose elements sum exactly to target.

A subarray is a contiguous range of one or more elements. Different index ranges count separately, even when they contain the same values.

countSubarraysWithTargetSum(nums: int[], target: long) → long

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

The subarrays at indices 0 through 1 and 1 through 2 each sum to 2.

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

The ranges [1, -1], [1, -1, 0], and [0] have sum 0.