cpp-flashcards/org/study_deck_02/dsa/arrays-hashing/0242-valid-anagram.org

#+ANKI_DECK: study_deck_02
* DONE 0242. Valid Anagram :easy:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0242. Valid Anagram][0242. Valid Anagram]]
:END:

Given two strings ~s~ and ~t~, return ~true~ if ~t~ is an anagram of ~s~, and ~false~ otherwise.

*Example 1:*

*Input:* s = "anagram", t = "nagaram"

*Output:* true

*Example 2:*

*Input:* s = "rat", t = "car"

*Output:* false

*Constraints:*

 - ~1 <= s.length, t.length <= 5 * 10^{4}~

 - ~s~ and ~t~ consist of lowercase English letters.

*Follow up:* What if the inputs contain Unicode characters? How would you adapt your solution to such a case?

** DONE Approach
Write your approach here.

** DONE Python
#+begin_src python :lc-problem 242 :lc-lang python3
class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
#+end_src

** DONE C++
#+begin_src cpp :lc-problem 242
#include <map>
#include <string>
class Solution {
public:
  bool isAnagram(std::string s, std::string t) {
    std::map<char, int> ctr;
    for (char c: s) {
      ctr[c] += c;
    }
    for (char c: t) {
      if (ctr[c] == 0) {
        return false;
      }
      ctr[c] -= 1;
      if (ctr[c] == 0) {
        ctr.erase(c);
      }
    }
    return ctr.size() == 0;
  }
};
#+end_src