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

Hey everyone, here I have discussed the Q. 242 of leetcode with code in C++.
Connect with me:
Instagram : / i_m_sarvesh__
LinkedIn : / sarvesh-roshan-1429b3158
Github : github.com/imroshan12

[@anupamagrawal524]

great and very simple to understand, thank you

[@gamingwithkode2213]

good one!!👍

[@TheDima23]

nice, thank you !

[@nskkknagajayanth1199]

code explanation was nice and effective.

[@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.

[@1912harshit]

good explanation