Anagram Pairs Verification

In this task, you need to verify if two provided strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the other.

Input:

Two space-separated strings, Str1 and Str2.

Output:

Print 'True' if the two strings are anagrams of each other; otherwise, print 'False'.

Example:

Input:

listen silent

Output:

True

Constraints:

1

Question

Anagram Pairs Verification

In this task, you need to verify if two provided strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the other.

Input:

Two space-separated strings, Str1 and Str2.

Output:

Print 'True' if the two strings are anagrams of each other; otherwise, print 'False'.

Example:

Input:

listen silent

Output:

True

Constraints:

1 <= N <= 10^5
1 <= M <= 10^5

Note:

Both strings are in lowercase and do not contain internal spaces.

Accepted Answer

Verify if two strings are anagrams of each other by rearranging their letters.

Create character frequency maps for both strings.
Compare the frequency of characters in both maps to check if they are anagrams.
Return 'True' if the frequencies match, else return 'False'.

Anagram Pairs Verification

Input:

Output:

Example:

Input:

Output:

Constraints:

Note:

Ernst & Young Senior Software Engineer interview questions & answers

Popular interview questions of Senior Software Engineer