CT1764

Cora's Wayward charms

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

It is audit day at the coral atoll of Pearldeep. Cora spreads the charms records across the table and picks up a sharp pencil. 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| <= 50; lowercase English letters.

Example 1:

Input: mtwkebumudsdyhuemhitztzmswzoc kbeyzhmtomddsiwcmtmzehtwsuuzu
Output: YES

Example 2:

Input: eyfxmkctlmgqysipuypbqwtm umsftybpkmtqewgqpymiylcx
Output: YES

Example 3:

Input: xcjqdifnaoakgxqfomlbqldgzlqljuvj ojqldlqaglxamclxjizdbvgfjfouqqnk
Output: YES

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Cora's Wayward charms - EASY Coding Problem | CodeTikki