Anagram Checks

Given two strings s0 and s1, return whether they are anagrams of each other.

Constraints

• n ≤ 100,000 where n is the length of s0
• m ≤ 100,000 where m is the length of s1

https://binarysearch.com/problems/Anagram-Checks

Examples

Example 1

Input

• s0 = listen
• s1 = silent

Output

• answer = True

Example 2

Input

• s0 = bedroom
• s1 = bathroom

Output

• answer = False

Solution