Anagram Check

Problema

Two phrases are anagrams if they contain exactly the same letters the same number of times, ignoring case, spaces and punctuation.

Implement is_anagram(first, second).

first: The first phrase. second: The second phrase.

Return true if the phrases are anagrams.

0 ≤ length of each ≤ 10,000 (ASCII)

Exemplo 1

Entrada:
first = "Listen"
second = "Silent"

Saída esperada:
expected = True

Entrada:
std::string first = "Listen";
std::string second = "Silent";

Saída esperada:
bool expected = true;

Entrada:
string first = "Listen";
string second = "Silent";

Saída esperada:
bool expected = true;

Both use e, i, l, n, s, t once each.

Exemplo 2

Entrada:
first = "apple"
second = "paddle"

Saída esperada:
expected = False

Entrada:
std::string first = "apple";
std::string second = "paddle";

Saída esperada:
bool expected = false;

Entrada:
string first = "apple";
string second = "paddle";

Saída esperada:
bool expected = false;

The letters and counts differ.

Tente sozinho primeiro e depois abra uma dica de cada vez.

Dica 1

Remove non-letters and ignore case before comparing.

Dica 2

Count character frequencies for both phrases, or sort their normalized forms.

Dica 3

Punctuation and spaces should not affect the result.

Complexidade esperada

O(n) time, O(1) extra space

Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.