Find Subarray with the given sum k 🔥| Hashmap in Java | DSA-One Course #28

Hey guys, In this video, We're going to solve a popular HashMap Problem, Find the subarray with given sum.
Solving the problems from here: practice.geeksforgeeks.org/pr...
🥳 Join our Telegram Community:
Telegram channel: telegram.me/realanujbhaiya
Telegram group: telegram.me/dsa_one
🚀 Follow me on:
Instagram: / anuj.kumar.sharma
Linkedin: / sharma-kumar-anuj
Twitter: / realanujbhaiya
💸 Use coupon code ANUJBHAIYA on GeeksforGeeks to avail discounts on courses!
📚 Complete DSA Playlist: • DSA-One Course - The C...
Complete Android Development Playlist: • Android Development Tu...
Hashtags:
#anujbhaiya #dsaone
Ignore these tags:
subarray with given sum
find subarray with given sum
subarray with given sum geeks for geeks
subarray with given sum geeksforgeeks
subarray with sum 0
subarray sum equals k
number of subarrays with sum equals k
subarray with given sum gfg
subarray with given sum c++
find subarray having given sum
subarray with given sum negative numbers
find the subarray with given sum
find the subarray having the given sum
find subarray with a given sum
hashmap
hashmap in java
java hashmap
hashmap java
how hashmap works
how hashmap works internally
hashmap vs hashtable
hashmap internals
java hashmap tutorial
hashmap internal working in java
design hashmap
hashmap internal implementation in java
design hashmap leetcode
hashmap java 8
hashmap interview questions
python hashmap
how hashmap works internally in java
code
what is hashmap in java
java hashmap explained
hashmap implementation

[@tejassontakke8382]

Nice to see practical implementation of hash map.

[@hawking3396]

Thanks anuj bhaiya. You are building a great cornerstone for students. In between how to learn kubernetes and how to start learning devops. Could you please tell about this?

[@darshansomani1110]

OP Logic Building! Able to think and code in correct way. Thanks a lot!

[@tanmaykale6856]

Sir Can you tell me how to start DSA for beginners. All resources.

[@indiradas1280]

Anuj Bhaiya ,You are the best educator for me🙏🙏💐 Take love & respect from West Bengal 💙 God bless you Bhaiya 😇

[@VivekChandra-vr7gb]

Adding variations to the problem statement is absolutely marvellous 👍

[@falakhasija2813]

Sir you teach the best!! I was stuck on this problem since past 2 days and now it's all clear. Thank you for this amazing content.

[@Dark2115azazel]

can we solve this problem by kadanes algo?

[@arpanbhowmick847]

Bhaiya...it will be helpful if u provide some variation problems on every lecture...like u did here ( few more )❤️

[@kunalmishra6869]

Best lecture on Hashmap 😍

[@chandrakanthsagar8886]

Valuable information... extraordinary teacher.. 💥💥

[@ranchocomedy7785]

Bhaiya aapke videos se bohot acche se samaj aaraha hai thnank you.

[@gwalaniarun]

Amazing video mate. Thank you so much.

[@blackhawk3168]

Hey anuj. Thanks for the great content. Tried doing the largest subarray with equal 0,1 problem as mentioned at the end of this video. I think its not a variant to this one and would be solved with a different logic altogether. As if we do find subarray with sum zero, the algorithm of this video will find the LAST subarray with sum zero and not the LARGEST subarray with sum zero. If I'm right, please do cut the end part of this video.

[@ANKITKUMAR-wn1ub]

Great explaination bhaiya 🙏🙏

[@stupidbutcurious6206]

very well explained... i cam across this question while searching for another similar but a littile more complex... can you please help solve.. The Question is:- Given an array of integers of size N, count all possible distinct triplets whose sum is exactly divisible by given integer K. for triplets i, j, k --> i

[@debanjanguhathakurata5221]

Very Nicely Explained Sir.

[@devendrakharatmal8924]

Well explain thanks bhaiya👍

[@prakhargahlot9373]

You explained it really well

[@aasheeshprem1238]

well done, Anuj Bhaiya... thanks!

[@stith_pragya]

Thank You So Much Anuj Bhaiya.................🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@YashGupta-zh8ch]

Thanks man . This was so good!

[@buddhadebgreat]

Very informative video bhaiya

[@ansjamil7521]

Excellent Brother you made my day

[@LaveshGarg]

YES, IT WAS HELPFUL

[@NAMANMARKHEDKAR]

Wow bhaiya , Great explaination :D Thankyou so much

[@TechWek1]

gajab bhaiya 🔥🔥 very helpful content

[@startupmindset7597]

i spend my all day with anuj bhaiya, shradha didi, and geeksforgeeks

[@ZSHADOW18]

Also one single element is also part of the subarray, so the last element '5' is also part of the subarray;

[@vikashkumarbhagat3001]

There can be multiplie subarray but here we need to print any one If question is find all possible subarray with given sum ,then your ans will also be included.

[@mohammedmustufa9928]

@@vikashkumarbhagat3001 But what he told will not work for the largest subarray. In the example the largest subarray with sum 5 would be [-5, 15, -10, 5], but if we do it according to what he said largest subarray is [15, -10].

[@JGyanRaj]

Amazing ♥️

[@prikeshsingh5971]

OSM 👍👍

[@user-tk2vg5jt3l]

Thank you Bhaiya

[@chandrakantkamble3371]

thanks for explaining

[@InvincibleMan99]

Thanks There is one more variation, that you have to count the num of subarrays.

[@chubbooo]

thanks, it is really helpful

[@techcode752]

Thanks Bhaiya For This Efforts 😃😃😃😃

[@bestdeal3385]

best teacher 😊

[@benkigera]

I don't understand his language but i still passed my test because of his explanation that i couldn't find in English videos.

[@hemanthkumar240]

Thankyou ...🙏

[@satvik0099]

Best explanation sir 🎉❤

[@hypnotic_dude]

Really helpful bhaiya !!!! ❤

[@siddharthdixit5009]

Perfect I have gone thorugh multiple videos bit none of them as compared to your solution

[@m.afnan2018]

Maza aagya bhaiya,,,

[@anshulgoel1940]

Another way of handling that special case is to add a entry in HashMap - map[sum] = -1

[@gazzhere]

THANKYOU SOOOOO MUCH BHAIYA

[@mrsttechno5974]

nice understand

[@ineerajnishad]

Maja aaya!💚

[@tusharchuhaan7506]

yes it was helpful

[@tech_wizard9315]

Please add questions list for each video of DSA course. Enough to crack tech giant's

[@devanshprakash8354]

V nice explanation

[@garvgoel1743]

very helpful

[@AnishKumarSingh-su1dg]

Helpful :)

[@princepatel9080]

Helpfull

[@mycreations6383]

we can also use 2 pointers technique

[@Knowledgeduniya1432]

First time smjh m hi nhi aaya 🤣 Second time ek ek shabd samjh m aaaya♥️😁🙏🏼

[@adarshmishra6699]

Anuj bhaiya op 💯💯💯

[@abhishekarora437]

Bhaiya...please increase frequency of lectures

[@aravindsingh08]

bro this was bomb of a video. gold content really!

[@sijalfatima7043]

O Man you doing great 👍

[@ultrasourus9715]

whahh yaar internet ke fayede toh bhot hai

[@nayanasagar6062]

1st like❤️

[@anshul2675]

I was stuck at this question in the past interview I wish I found it sooner 😑

[@AyushSharma-zl7fw]

Bhaiya please focus and complete the DSA-One series🙏🏻 make your DSA-One series, better than Apna College, content wise. Because their content is very vast and lots of different questions, but explanation is not good. You're the god of explaining things❤️❤️ Ps- till now your content of Dsa-One is 🔥❤️

[@ANKITKUMAR-wn1ub]

Ek dam sahi bola bhai

[@agyaani8060]

❤

[@SURESHKUMAR-bq8ho]

wo scripted hai esliye 😁😁

[@gauravgautam5963]

Exactly @SURESH KUMAR 😂😂😂😂😂😂

[@sayantanacharya2040]

Just wondering if this works in case of a zero element in the array?🤔

[@Knowledgeduniya1432]

Imp point 09:22

[@himanshukhairajani]

I wonder how can someone dislike this video !! such a knowledgeable content.

[@raghavsharma4195]

Bhaiya plz any list or sheet to practice or follow for dsa after ur vids???

[@aniketkirar1194]

thank you bhaiya the way you explain logic it's so simple and good that anyone can get it❤️❤️❤️

[@akashjagtap1096]

Just one correction, add map.put() in else block ->> else { map.put(currtSum, i); }

[@parthmangalkar]

Please can any1 tell me any other optimum approach which does not use hash map?

[@nikhiljain6431]

I faced many problems in this video, If there is only 1 element then it will not work or if the sum is 0 then every time currSum - sum will hold true because your sum is zero, this means you are basically checking if currSum is present or not, spoiler alert it's always present because you are putting currSum. Hope you see this and no hate towards you, what you are doing is very helpful for students like me

[@10daysAgo]

any solution for sum =0 ?

[@sharad3877]

in this given example, we have two sub arrays whose sum equals to 20. So I think we need to store all such pairs.

[@whoasadkhan]

Can anyone please explain me .... In C++ How to write thi line .... Start = map.get(cursum-sum)+1;

[@aeroabrar_31]

@@whoasadkhan map[cursum-sum]+1;

[@aniketchaurasia2323]

1 st one to comment bhaiya

[@SunnySingh-is2wm]

Sir subarray with sum equal to zero with three elements taken in pairs bhi isse ho jaega??

[@swatidhull5367]

bhai make video on flutter ad swift............ please,.....................................

[@mdshadabalam7788]

bhai thora jaldi videos upload kr dea kro, kafi wait karna pdta hai

[@itzmanny8905]

Brute force approach int arr1[]={10,5,6,1,8,5,2}; for(int i=0;i

[@bhushankorg5606]

Are bhai tu ekde....😁

[@kanagalashradhaa7398]

Can we also solve this Kadane algorithm

[@harshk8609]

Bhaiya dsa ki video jadli jaldi dal do🙂🙂🙂

[@manu-singh]

Yesss

[@agyaani8060]

Ha❤

[@syedtaslimkawser984]

3,2,3 sum=6 .. its returning 0,-1; but actual answer must be 0,2

[@ECPrashantGoyal]

tu cheez lajawab

[@Knowledgeduniya1432]

Typical th per logical th practice karta rahunga bhaiyaa

[@tausifahmad2007]

I think this code will give the first subarray only, what if we have to find all subarray/number of subarray which is equal to given sum ??

[@ashishkumarnaik4255]

i replaced the sum with 0 and transformed the array means replaced 0 with -1 and saw that the result is not accurate input={1,1,0,1,1,0,0} output - 3,6 Could you please check the code once @Anuj Bhaiya

[@mohammedmustufa9928]

``` Python: ``` arr = [1, 1, 0, 1, 1, 0, 0] cur = maxi = 0 d = {0:-1} for i in range(len(arr)): if arr[i] == 1: cur += 1 else: cur -= 1 if cur in d: maxi = max(maxi, i - d[cur] + 2) d[cur] = i print(maxi)

[@sahilgupta7001]

your code won't work for the largest subarray with sum equal to k, please can you check it

[@darklord1781]

Sliding window laga sakte hai na ?

[@shresthgupta2670]

moj aa gai

[@chinmaychaudhari4143]

Bhaiya java me pointers explain karva do

[@shaikgousemujeeb269]

Nice explanation, what if I have 0 in the array value for the first question? In C# Dictionary keys should be unique right what if I found duplicate keys? will then also this algorithm work?

[@whoasadkhan]

Can anyone please explain me .... In C++ How to write thi line .... Start = map.get(cursum-sum)+1;

[@chiragsaurav9414]

We can't find all subarray by using 2 nested for loop as you mentioned at( 2:10). We have to use 3 nested for loop to find all subarray in brute force method.

[@whoasadkhan]

Can anyone please explain me .... In C++ How to write thi line .... Start = map.get(cursum-sum)+1;

[@ratankumar1399]

@@whoasadkhan hey you can write like this start=m[curr_sum-k]+1;

[@arpitnakrani8108]

not working in 0 & 1 .. bcz if map contains repetive sum then if we want to update start then it will look for last inserted value in our case we want first inserted value

[@StudyiMnimal1743]

yes

[@sahibnoorsingh2432]

n value is missing, n=a.length;

[@riturajsingh9744]

#thanks

[@ZSHADOW18]

I did't get one thing, why are we storing the curr sum as key and index as values in HashMap. Shouldn't we store the index as key and curr sum as values.

[@arpitnakrani8108]

its key value pair so if we have to set value which we want to retrive. here we want index number as output so our index should be value and key will be currsum

[@nikhil2373]

How would be 2indexing

[@dudamneerajdattu1459]

my bruteforce approach (155/165 cases passed) : vector subarraySum(vectorarr, int n, long long s) { // Your code here vector v; int sum = 0; for(int i = 0; i < n; i++) { for(int j = i; j < n; j++) { sum += arr[j]; if(sum > s) { break; } else if(sum == s) { v.push_back(i + 1); v.push_back(j + 1); return v; } } sum = 0; } v.push_back(-1); return v; } the hashmap solution is showing TLE (133/165 cases passed), anyone correct me. vector subarraySum(vectorarr, int n, long long s) { unordered_map u; int sum = 0, index = 0; for(int i = 0; i < n; i++) { sum += arr[i]; u[sum] = index++; if(u.count(s)) { v.push_back(1); v.push_back(i + 1); break; } if(u.count(sum - s)) { v.push_back(u[sum - s] + 2); v.push_back(i + 1); break; } } if(v.size() == 0) { v.push_back(-1); return v; } return v; }

[@subhamdudheria9523]

Instead of that special case of currsum-sum==0 you could simply add map.put(0,1) right before the loop

[@ajay2552]

you mean (0,-1)?

[@subhamdudheria9523]

@@ajay2552 Kuch bhi karo kya farak padta hai

[@ajay2552]

@@subhamdudheria9523 are you sure? Kyuki jab i+1 print hoga.. tab 0 print hona chaiye.. but 2 ho jaega

[@subhamdudheria9523]

@@ajay2552 Start aur end variable Lelemge

[@ashishkumarshawhitchem2017]

for leetcode 560 what will be the changes

[@tulsidas2908]

Kaya Yaar bhaiya unordered map bhi padha dete CPP mei

[@bharatrav1764]

bhaiya 12.30 se 13.00 calculaton thoda mistake ho gya ...if change that part it is beneficial for absolute biginer