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.

Vincoli

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

Esempi

Input:
first = "Listen"
second = "Silent"

Output atteso:
expected = True

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

Output atteso:
bool expected = true;

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

Output atteso:
bool expected = true;

Input:
first = "apple"
second = "paddle"

Output atteso:
expected = False

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

Output atteso:
bool expected = false;

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

Output atteso:
bool expected = false;

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

• UW TCSS 142 Introduction to Programming - master syllabus