<p>Given two strings <code>s</code> and <code>t</code>, return <code>true</code> if <code>t</code> is an <span data-keyword="anagram">anagram</span> of <code>s</code>, and <code>false</code> otherwise.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">s = &quot;anagram&quot;, t = &quot;nagaram&quot;</span></p>

<p><strong>Output:</strong> <span class="example-io">true</span></p>
</div>

<p><strong class="example">Example 2:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">s = &quot;rat&quot;, t = &quot;car&quot;</span></p>

<p><strong>Output:</strong> <span class="example-io">false</span></p>
</div>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length, t.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>s</code> and <code>t</code> consist of lowercase English letters.</li>
</ul>

<p>&nbsp;</p>
<p><strong>Follow up:</strong> What if the inputs contain Unicode characters? How would you adapt your solution to such a case?</p>

class Solution {
public:
    #include <iostream>
#include <string>
#include <unordered_map>

// Function to determine if two strings are anagrams of each other
bool isAnagram(const std::string& firstWord, const std::string& secondWord) {

    if (firstWord.length() != secondWord.length()) {
        return false;
    }

    std::unordered_map<char, int> charCount;

    for (char c : firstWord) {
        charCount[c]++;
    }

    for (char c : secondWord) {
        charCount[c]--;
        if (charCount[c] < 0) { //Check if negative
            return false;
        }
    }

    return true;
}

int main() {

    std::string s = "computerscience";
    std::string t = "sciencecomputer";

    if (isAnagram(s, t)) {
        std::cout << "True" << std::endl;
    } else {
        std::cout << "False" << std::endl;
    }

    return 0;
}
};
9600