CT902

Nico's inscriptions Letter Shuffle

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Morning light hits the galleon yard of Masthead as Nico unrolls the day's manifest of inscriptions. The tally will decide the next shipment. 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| <= 175; lowercase English letters.

Example 1:

Input: kfspsoikylsnniuntkbadjosuopgggyiztoadbutdjdxfsejxeikcfzctssrwdbwsalpwrjuwwtgrpvhwsimf pfjgbgiswwtdvsflthiixkkldaciybknuerxsordsaztnopbsoiudjjogymkpwwsfrsptuuszfwgjwadtnsec
Output: YES

Example 2:

Input: ckspdqoryqvodraxmowovxurgajisrvdrbzbzhvcrtbvqyslodejpocqxppwttgoemojfyawembambuhyyljtaozatdjrsfqkskaeoygbmwpnszguolqvqgu zpwpezkmgfzarwpplybre
Output: NO

Example 3:

Input: fvvtnvnqjrhtuznyyteybspswnrbjpvrnmgmxxunnrwfpjbjododolkecgemtzxvnvdlvywlvkaljeyodawdovomhxildfoyvvmdwolsdgzrtpluaovqkc rpzsgmuucywggxujykyrwictsgrlomwtdvnrlibfdjkkyfzxszphrihrjtxwohpcgkzvksjfoajyinojbcocluuvgnqfcjedbfk
Output: NO

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Nico's inscriptions Letter Shuffle - EASY Coding Problem | CodeTikki