Subarray sum equals K | Number of subarrays with sum equals K | Leetcode #560

This video explains a very important programming interview problem which is to count the number of subarrays in a given array with sum exactly equals to K. This is leetcode #560 coding problem. I have shown the solution using many approaches. I have started with bruteforce approach and went on to finally show the most optimal approach for this problem. I have taken examples to arrive at the optimal approach from the most intuitive approach. Finally, i have shown the CODE for the optimal approach and the CODE LINK is given below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
CODE LINK: https://gist.github.com/SuryaPratapK/cc99cf19e8d65a96525ee1c87d3e75c7

Видео Subarray sum equals K | Number of subarrays with sum equals K | Leetcode #560 канала TECH DOSE