Hashmap - Important Problems | Anagram | Lecture 61 | JAVA and DSA Foundation Course

[@kinlearn]

Ma'am aap bhot achche se padhate ho. especially Two Sum. Ab concept mere dimag mein pakka ho gya. Thank you ☺

[@cybernewton8190]

Amazing problems based on hashmap wow mindblowing lecture

[@buildyourself-4U]

1st follow up question Approach : approach is just like two sum question's approach there we did a + b = target b = target - a; same apprach we can apply for that question : here, a + b + c = target c = target - a - b; by this you can solve this problem with O(N^2) instead of O(N^3) Solution : // question is available on gfg //remember implement hashMap in the loop //try to understand by self public static boolean find3Numbers(int arr[], int n, int target) { // Your code Here for(int i=0; i

[@manasvisingh2500]

Thank you soo much ma'am... Ma'am please start oops in depth

[@PruthirajPanda-e9u]

nice lecture all concept clear

[@CoderPro77]

Ma'am please do Qs sessions on leetcode with more numbers of questions too like you guys used to do earlier it really helped us alot ,

[@Sportscentre17]

Please check mam solve the leetcode questions in video

[@Factzspeaker234]

Mam Pls Solve problems on leetcode , like raghav sir Use to do , Makes it easier for us to for further practicing problems on leetcode on these topics🙏🙏!

[@amritavabanerjee6858]

Wow excellent

[@study089]

you are right

[@prankcall7144]

public static boolean isAnagram(String x, String y){ char a[] = x.toCharArray(); char b[] = y.toCharArray(); Arrays.sort(a); Arrays.sort(b); return Arrays.equals(a,b); }

[@VibeAndVoice33]

want more questions with ragahav sirr plss

[@harshchouksey7740]

amazing lecture👍👍👍

[@Beyondbalmiki]

Amazing mam

[@patricshane4146]

What is the space complexity of valid anagram approach 1?

[@mind9889]

Mam what if we have used XOR. Does it take less time and less space

[@SachinSharma-ou5pg]

When will pw provide time stamp in decode batch

[@ayushmishra5861]

Bhai aajse 2 saal pehle tak koi time stamp nahi deta tha tb kya log padhte seekhte nahi the?

[@AmaanKhan-xu4ft]

@@ayushmishra5861 point bole bhai

[@SachinSharma-ou5pg]

@@ayushmishra58613-3 hours ki video hai time stamp se thora easy ho jaata hai. Mar nhi jayege bina time stamp k bs thori productivity badh jayegi....

[@prathameshkadu9420]

Mazza nahi aya, Pls improve teaching.

[@Abhi_rudra007]

In the Isomorphic question, HashSet Concept is not working....

[@ankitai]

try st.contains(tCh) instead of st.add(tCh)