Subarray Sum Equals K | Count Subarrays with Sum Equals K | Hashmap Interview Questions Playlist

preview_player
Показать описание

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the problem count of subarray sum equals K using hashmaps in java. In this problem,

1. You are given an array of integers(arr) and a number K.
2. You have to find the count of subarrays whose sum equals k.

#hashmaps #datastructure #algorithms

Рекомендации по теме
Комментарии
Автор

I understood within the first 1:11 minutes because your way of explaining was crystal clear. Thanks a lot!

sleepypanda
Автор

Best teacher for coding on YouTube. Hands down, nobody is even close to him. Thanks Sir. I wish to meet you one day and thank you for your videos.

vadirajjahagirdar
Автор

One of the brilliant explanation to this problem on entire Youtube

thegreekgoat
Автор

Amazing, i am not a hindi native speaker but i understood your explanation perfectly. Nice idea of doing a run through the array and explaining k and y-k and maintaining count of prefix sum occurance.

vetiarvind
Автор

Excellent. As someone said, the solution was clear within the first minute. Awesome!

sachinkarve
Автор

poori u tube mein sabse acha coding explanation aap hi kre b kisi qsn mein fnstaa hoon or us qsn ki aap ki vdo mil jaati hai to man bahoot hi khush hoo jata hai😊😊

cavi
Автор

I am very thankful to you sir, you clear explanation of such simple things make us understand big concepts

layashmaveeramalla
Автор

Bro, thanks for explaining everything with so much patience. Finally samajh me aaya ki subarrays += map[prefSum - k] kyu kar rhe hai.

Possible variations of question:
> Find if subarray with sum exists; find range
> Find biggest/smallest subarray with sum; range
> Find no. of subarrays with sum; find ranges

leslieamaron
Автор

jaaan & puri shiddat se padhata hai..ki...bas yahi efforts se kisika bhi interest and intuitions badh jayenge. Hats OFF

vishalbarvaliya
Автор

Absolutely Fantastic!! I am amazed by your ease to explain.
Appreciate your help. I will send your links to my friends who are prepping.

sameersondur
Автор

After watching your video I got this problem, I tied up with this problem since long . finally you made me rid of it.

SanaAnsari
Автор

Had trouble getting this ques, 4th video for on this question. Finally got it. Thanks a lot. You teaching style is great!

ravimishra
Автор

Literally feel aati hai sir aapse padke. The reason is aap proper teacher lagte ho..jaisa hame 12 and iit tak mile hai and unse padkar feel aata hai padai kaa

sparshgupta
Автор

Thank you soo much. You are a savant at explaining these. This is the most straightforward video on the topic. Keep up the good work my man!

tejasgulati
Автор

Very Nice explanation. Thanks for covering the edge case scenario when index from 0 to "i" itself is sum. I have solved this problem before but never thought of this case. Thanks again Sumeet Sir, Thanks Pepcoding :)

pankajkohli
Автор

best explaination sir, abhi ek hi video dekh rha thaa and he told me, rat ko imeediate apki dekhi and crsytal clear ++, app c++ mein bhi code kare, it would helpfull for many students

dhruvasoni
Автор

tysm, itna acha hota hai jab koi hindi mai batat hai, kyuki i also think in hindi, dusre tutorial samjne mai jyada time lagta hai, thanks thanks thanks!

muskansawa
Автор

I watched 3-4 videos for this question. Here, I understood the concept in the first 1 min.

atmanirbharladka
Автор

Best channel ever. Sir you teach questions in very friendly way. Thanku sir 😊

mansigoyal
Автор

I was soo confused for this problem But sir you Have Explained Excellent

hehebohey