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.

Contraintes

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

Exemples

Entrée :
first = "Listen"
second = "Silent"

Sortie attendue :
expected = True

Entrée :
std::string first = "Listen";
std::string second = "Silent";

Sortie attendue :
bool expected = true;

Entrée :
string first = "Listen";
string second = "Silent";

Sortie attendue :
bool expected = true;

Entrée :
first = "apple"
second = "paddle"

Sortie attendue :
expected = False

Entrée :
std::string first = "apple";
std::string second = "paddle";

Sortie attendue :
bool expected = false;

Entrée :
string first = "apple";
string second = "paddle";

Sortie attendue :
bool expected = false;

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• UW TCSS 142 Introduction to Programming - master syllabus