Group Anagrams (LeetCode 49) | Full solution with 2 methods and examples | Study Algorithms

[@dhavalchaudhary1786]

I generally not hit like on youtube videos, but this guy nailed it. Thanks for your community contribution NIkhil.

[@vikashsharma9678]

sir you explaination to any algorithm is the best explanation i had ever seen ...only your explanation is enough to solve the problem no need to see the code

[@devprakash5320]

loved your explanation . But 1 thing I would like to correct . The time complexity of method 1 will be O(n k log k ) , where k is the length of the string , n is total strings . This is because sorting a string would take (k log k ) . Any way awesome explanation . thanks

[@WhosShamouz]

I was missing ONE idea and it popped in my head when I saw your first method, amazing explanation!

[@amitbhattacharya356]

I got really surprised by so a vivid and clear explanation. I appreciate your efforts.

[@nikoo28]

Glad I could help you out 😄

[@ricardohernandezmendez4207]

At the beginning it was difficult to find out how to solve this problem, but with this explanation it make it easy to solve it. Thank.

[@plutomessi21]

Dhanyavad bhaiya, you are the best teacher I have seen on youtube😭

[@nikoo28]

So nice of you

[@akashddeepchitransh4537]

Hey, you are super underrated, I didn't know about you channel but now I know and will be utilizing it in my preparation.

[@mazthespaz1]

i'm new to python and this was my solution def smash(str): tmp = 1 orda = ord('A')-1 ls = len(str) for i in range( ls ): tmp = tmp * (ord(str[i]) - orda) return tmp def groop(wordlist): grope = {} for word in wordlist: hashy = smash(word) if hashy not in grope: grope[hashy] = [] grope[hashy].append(word) return [val for val in grope.values()] if __name__ == '__main__': # arr = [ 'cat','tea','tan','ate','nat','bat' ] arr = [ 'eat','cars','tea','scar','a','listen','silent'] print (groop(arr))

[@mazthespaz1]

this solution worked in codewars but not leetcode. i need to refine the smash function to prevent duplicate hashes

[@akshanshsharma8157]

In the sorting way, the time complexity is not O(nlogk) but rather O(n.klogk)

[@Donkle365]

Hey, I found this video trough the article and thank you for all the work, it really helped me. The solution of method 2 at line 34 has a mistake: "freq++;", you can't ++ an array, so we need to do freq[c - 'a']++ :)

[@Vishal-8995]

Premium Explanation

[@nikoo28]

🤘🏻

[@shaileshsathe9779]

Very well explained the techniques, code and dry-run. Great work Nikhil.

[@shaileshsathe9779]

I don't know why, I ran both techniques sorting and frequency but sorting is showing less time than frequency method. sorting => 15ms frequency = 29ms. I believe its random.

[@aryamiraozdemir]

@@shaileshsathe9779 I'm not sure but I think it might be because frequency string has to be sorted so it takes even longer to count everything and sort the letters alphabetically

[@ramsidh2218]

great explanation with animation step by step

[@shahbazhussain2128]

If I use sorting logic will be my solution wrong? I am facing difficulty in understanding the HasMap and Frequency Concept.

[@yusufnurwahid898]

Very clear explanation! Keep up!!! 👍🏻

[@ElinaAdibi-b1t]

Thank you, you explained it very well!

[@lofiboy7866]

We need to write getfrequency string string method also sep?

[@TBVSAITEJA21BCE840]

obviously

[@hersheynohara5887]

That's an amazing explanation! 👏👏

[@RohitSharma-q8j1p]

great video and best ever explaination ever

[@abinashpanda393]

This might not pass all test cases, you have to add a delimiter like '#' while concatenating numbers in freq variable.

[@nikoo28]

passes all cases on Leetcode as per the problem constraints. If you have different strings patterns, it might need a little tweaking.

[@abinashpanda393]

​@@nikoo28 You are right for ["bdddddddddd","bbbbbbbbbbc"] this will not going to pass. Probably new test cases have been added. Thank you for your response. Your tutorials are really helpful.

[@cricworld5806]

sir awesome explanation ...................

[@edd_gos]

bro, thank you for the video. it was very usefull (like all your videos)

[@yfchina143]

this there any better way for a frequency string algothrim?

[@zanefalcao3230]

very nice explanation

[@jst8922]

8:14 should be "nat", not sorted string "ant". Otherwise your tutorials are the best regarding leetcode problems, because you explain with examples what should the code do.

[@cuteangel1726]

Appreciate your effort !!!

[@sayanmanna2511]

But why light theme?? I am blind now..

[@nikoo28]

Light is easier for diagrams and animations. Will keep using light theme.

[@hazerasarker2442]

Thank you Nikhil :D

[@devansh_4u]

beats 30% java codes, wonder what could be a better solution!

[@nikoo28]

If you are concerned about having an overall faster solution, C++ should be the preferred language. Even with Java you can leverage some sort of caching and pre-processing of some results to obtain faster solutions. Generally not needed.

[@devansh_4u]

@@nikoo28 thanks sir

[@mujeebbridgetown]

Nice explanation

[@sysybaba420]

Great video as usual thanks for this! PS its not pronounced vo-i-la but just vo-la, hope this helps!

[@abhishekshankar6305]

you are the best

[@yogeshganpule2695]

tried watching but you just explained what the code does and its too confusing for me to undertsand what for each freq [c -'a']++; Does

[@nikoo28]

c is the actual character…let us say it is character ‘k’ And we do c - ‘a’ What happens internally is both are converted to ascii Small ‘a’ has ascii 97 The character ‘k’ has ascii 107 So when you do c - ‘a’ we get 107-97 = 10 That means freq[10] This represents 11th character as array is 0 based indexing Means we are referring to frequency of 11th character in the English alphabet which is letter ‘k’

[@yogeshganpule2695]

@@nikoo28 Thanks .

[@MahiM-ze4hm]

Awesome 👏✊👍

[@studies3943]

your accent is sweet

[@fourieruddin871]

Best

[@himadripaul7332]

Excellent ... But disheartened to see less subscribers ... ☹️😑🙂

[@nikoo28]

Yea…I don’t understand why my channel does not show up in results and suggestions. I have been doing everything possible: video descriptions, links etc.

[@shaileshsathe9779]

@@nikoo28 You can add keywords like Leetcode, Anagram, Interview Prep just like you added for String.Maybe it will work

[@boomshakalaka8567]

There's nothing correct about this video. Lol. Indian programmers lulz

[@nikoo28]

did you find some problem in the explanation or the method? Always up for improvement...

[@Sarvy001]

@@nikoo28 I have found another solution here. Not explained in detail as you have done, but this one has less lines of code. kzbin.info/www/bejne/nHKtonSkerykZtE&ab_channel=ThatIndianCoder

[@Nishi-Tiwari]

@@nikoo28 You are best!