Array Contiguous Sub Array with Sum K LeetCode (Subarray Sum Equals K)

Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.

Example 1:

• Input: nums = [1,1,1], k = 2
• Output: 2

NOTE:

• The length of the array is in range [1, 20,000].
• The range of numbers in the array is [-1000, 1000] and the range of the integer k is [-1e7, 1e7].

This is interesting and popular problem in Wikipedia and several forums including LeetCode, GeeksForGeeks A collection of hundreds of interview questions and solutions are available in our blog at Interview Question

Solution