2. Valid Anagram | Strings - Easy |

[@SabinPoudel-iw2rf]

Awesome Explanation!!!

[@AyushiSharmaDSA]

thank you :)

[@MonikaJethani]

This can be optimized further

[@oggystocky]

Didi, how many questions have you in leetcode? Can you share just approx figure

[@AyushiSharmaDSA]

@@oggystocky I have done around 650, but don’t run after quantity, practice quality problems :)

[@oggystocky]

@AyushiSharmaDSA Ok di, Thank you for helping me out 😊

[@AyushiSharmaDSA]

@@oggystocky anytime :)

[@vikaas.sharma]

Mam can we did it using only one map like incrementing one character from first string and decrement character from second stirng like that

[@AyushiSharmaDSA]

yes we can do that as well :)

[@aurobindamishra8463]

can you share all code in java it will be really helpful

[@AyushiSharmaDSA]

sure let me add that :)

[@AyushiSharmaDSA]

added java code! :)

[@samiranroyy1700]

class Solution { public boolean isAnagram(String s, String t) { char[] str1 = s.toCharArray(); char[] str2 = t.toCharArray(); Arrays.sort(str1); Arrays.sort(str2); if(Arrays.equals(str1,str2)) { return true; }else{ return false; } } }

[@CodewithKing360]

SLIDING WINDOW fixed size + COMPARE 2 AARAY OF 26 SIZE EQUAL 😅