problem:

<aside>

Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.

A subarray is a contiguous non-empty sequence of elements within an array.

</aside>

solution:

<aside>

</aside>

code:

complexity:

<aside>

</aside>

walkthrough:

<aside>

input:

output:

</aside>