Anagram Check

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).

Input

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

Output

Return true if the phrases are anagrams.

Restricciones

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

Ejemplos

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

Salida esperada:
expected = True

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

Salida esperada:
bool expected = true;

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

Salida esperada:
bool expected = true;

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

Salida esperada:
expected = False

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

Salida esperada:
bool expected = false;

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

Salida esperada:
bool expected = false;

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• UW TCSS 142 Introduction to Programming - master syllabus