Deep in the smokehouses of Brineport, Bhanu studies rows of scrolls entries. One clean number will settle the guild's oldest argument. Task: Print YES if strings s and t are anagrams (same letters, same counts), otherwise NO. Input format: Two lines: string s, then string t. Output format: Print YES or NO. Constraints: 1 <= |s|,|t| <= 1719; lowercase English letters.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= |s|,|t| <= 1719; lowercase English letters.
