CT1256

Cleo Counts the letters

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Every season at the ink district of Scriptoria, someone must compute the guild dues owed. This year the task falls to Cleo, armed only with the letters register. 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| <= 81; lowercase English letters.

Example 1:

Input: uvlboemstvurwivmtduzsiamufwgjeswnfjbrtxbenrtmlnspvuuphqcgvgqidwtjudgnilgbeok urwhvngdjdvnegvrgveqfuibcuoejtuuwmgidjtzpltsxruettoafmsimqsmbnglwlusbinpbvkw
Output: YES

Example 2:

Input: ziaokcffuxpwivfdieqyoooftwixryajvkjvbnqcaqylnfqqsuzxphllhaojtdyxju gkakvvpfntldbbxobqhrxkzff
Output: NO

Example 3:

Input: zmrtwtuwsetmjrehmgexeaksdfwkmyjlafcfnbbnio szontmswxhlpgdpnwqf
Output: NO

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Cleo Counts the letters - EASY Coding Problem | CodeTikki