Lecture - 14 : HashMaps | Free DSA Course | AlgoPrep DSA Course

[@kaifansari527]

really grateful for the videos Really helpfull and azaming way of teaching

[@AryanYadav-n2j]

sir please upload homework questions please we are not able to do practice please or tell us some resources from where we can practice

[@ojaslad9886]

Sir getting Naughty 1:17:10

[@d4567]

which app he is using to teach anyone knows that?, looks good for making notes

[@vanshgarg3730]

Can you please enhance video quality as on 1080p also video is not so clear 😅

[@rudradas3416]

is the below solution is correct for last problem public static boolean pairExist(int[] arr, int k){ HashSet num = new HashSet(); for(int val: arr){ if(num.contains(k-val)) return true; num.add(val); } return false; }

[@sarthaksingh8763]

bdhiya pdhaya sir

[@ChandanKumar-xd1tg]

Maza aaya giya

[@amansaini.11]

why is this video unlisted?

[@algoprep_official]

Can you recheck and confirm!

[@amansaini.11]

​@@algoprep_officialnow it's live ❤️

[@MayureshSontakke-ji2gb]

47:53

[@Jv_Singh37]

plz add time stamps 😢

[@MayureshSontakke-ji2gb]

41:31

[@MayureshSontakke-ji2gb]

47:53