Valid Anagram | Leetcode 242 | Explanation and solution in C++

[@gamingwithkode2213]

good one!!👍

[@anupamagrawal524]

great and very simple to understand, thank you

[@nskkknagajayanth1199]

code explanation was nice and effective.

[@FamilyGuy_cheers]

Cant we say for a phrase to be Anagram the sum of the ascii values should be equal

[@lavgabri]

good thinking but this wont work. For example, sum of values of B & Y is equal to A & Z.

[@TheDima23]

nice, thank you !

[@adityapatil1839]

bool isAnagram(string s, string t) { sort(s.begin() , s.end()) ; sort(t.begin(), t.end()); if(s==t){ return true; } return false; }

[@programmer6548]

The one in the video is more efficient, I think, Also you can just return s==t;

[@GaganSingh-zz9el]

@@programmer6548 yes , but the code he provided gives out logn time complexity due to sorting but the code in the video is the optimal code.

[@karthikgururajan1131]

Very smart thinking xD

[@1912harshit]

good explanation