Anagram

main.cpp

#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

bool is_anagram(const string &str_a, const string &str_b)
{
    unordered_map<char, int> chars_occurrences;

    if (str_a.length() != str_b.length())
        return false;

    for (const char &chr : str_a)
        chars_occurrences[chr]++;

    for (const char &chr : str_b)
        chars_occurrences[chr]--;

    return all_of(chars_occurrences.begin(),
                  chars_occurrences.end(),
                  [](const auto &item){ return item.second == 0; });
}

int main()
{
    cout << boolalpha;

    cout << is_anagram("dog", "god") << endl;
    cout << is_anagram("dog", "fog") << endl;
    cout << is_anagram("world", "owrld") << endl;
    cout << is_anagram("world", "word") << endl;
    cout << is_anagram("world", "wonderful") << endl;

    return 0;
}