Glad to know that you liked the content and thank you for appreciating. The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos. So, keep motivating, keep learning and keep loving Pepcoding😊
Hope you love the explanation. For better experience and well-organised content Visit- nados.pepcoding.com You can post your query on community tab. Don't forget to follow us on Instagram instagram.com/pepcoding/
Sir, I am unable to understand the Sorting done in the ArrayList in such questions. I tried similar sorting in C++, but the some test cases are still not passing. Please tell what should I do ??
No need for else part, more concise for loop: for (String str : strings) { String key = getKey(str); if (!hm.containsKey(key)) { ArrayList list = new ArrayList(); list.add(str); hm.put(getKey(str), list); } hm.get(key).add(str); }
I was stuck at this question for so long and this solution made me love the question
Your explanation is one of the best on youtube on these subjects. Keep up the great work !
Glad to know that you liked the content and thank you for appreciating.
The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos.
So, keep motivating, keep learning and keep loving Pepcoding😊
Nice explanation, Thank you.
the best explanation to question and solution both, understood thoroughly, thanks a lot, keep doing great work (Y)
else part me I think phri se list ko map me put karna padega
eg:
else {
List list = map.get(key);
list.add(str);
map.put(key, list);
}
Great explanation ! Please confirm if the time and space complexity are O(n^2) and O(n) respectively. Thank you :)
Hope you love the explanation. For better experience and well-organised content Visit- nados.pepcoding.com
You can post your query on community tab.
Don't forget to follow us on Instagram
instagram.com/pepcoding/
Sir, I am unable to understand the Sorting done in the ArrayList in such questions. I tried similar sorting in C++, but the some test cases are still not passing. Please tell what should I do ??
You are a rockstar !
I took every string sorted it and made it as key
so the map was
map m;
Good, for better experience and well organised content sign up on nados.io and keep learning.
Wow
No need for else part, more concise for loop:
for (String str : strings) {
String key = getKey(str);
if (!hm.containsKey(key)) {
ArrayList list = new ArrayList();
list.add(str);
hm.put(getKey(str), list);
}
hm.get(key).add(str);
}
sir ye playlist kb tk complete ho jayegi...
abhi to chalegi bro
IF THE NUMBER IS LESS THAN 0, ADD 26 TO IT. THATS THE MAIN HINT