Subarray Sum Equals K - Prefix Sums - Leetcode 560 - javascript
Subarray Sum Equals K - Prefix Sums - Leetcode 560 - JavaScript
In this video, we will solve the [Subarray Sum Equals K] problem using prefix sums.
The problem is:
Given an array of integers `nums` and an integer `k`, find the total number of subarrays whose sum equals `k`.
A subarray is a contiguous part of an array.
We can solve this problem using prefix sums. A prefix sum is the sum of all the elements up to and including a given index.
To find the number of subarrays whose sum equals `k`, we can use the following algorithm:
1. Calculate the prefix sums of the array.
2. Iterate over the prefix sums, and for each prefix sum, find the number of subarrays whose sum equals `k - prefixSum`.
3. Add the number of subarrays for each prefix sum to get the total number of subarrays whose sum equals `k`.
![АНОНС: 🔔 Ghost of Tsushima прохождение 100% [Сложность Кошмар] Ultra HD GamePlay](https://images.videosashka.com/watch/riyN37Kq6PE)
