CT1925

The charms at Stillwater

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

The council of the crane marshes of Stillwater pays by the answer, and Zaid intends to earn it. First: the full register of charms. 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| <= 183; lowercase English letters.

Example 1:

Input: lvaasvbmzekpqwreggonlhflspryytrlflldqhedmmygdfgytul lghstyotgdpyaqdygbyvgpmndlrlaqlmmrlfesrehvulffwklze
Output: YES

Example 2:

Input: liq rjbjmoininzwakbetvgyinokxqfxhpfyagguobqhnvxcyovdzuuzhktsupkglrunscfxgijcfammhenzyhofsybnylkuzpxzvtlhopospkttjoarevxwymiecpddwjdbipaciikpotiykgwtfsu
Output: NO

Example 3:

Input: cadaexvnzdrhvjodsnsdsgtlvj evnaigmpcaqgdarcczixiyfgvhhgpjaakzgrccxonjqpglbelajedqyufhpcdtrufibpkrcmgmxdlmtmujqtqvmepmkliozszdswtlmkimbdytyik
Output: NO

Constraints:

1 <= |s|,|t| <= 183; lowercase English letters.

Loading...
Test Cases:No test cases
No test cases available.