CT1249

The Letter Shuffle of the Rustic labels

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

It is audit day at the poppy fields of Scarlet Plain. Yusuf spreads the labels 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| <= 160; lowercase English letters.

Example 1:

Input: vuswixsbkngyu bmnmzpvbxpjs
Output: NO

Example 2:

Input: a ffvaaromqqufekdijscvrbjpyfvbmkn
Output: NO

Example 3:

Input: pbavginfjzqa gvxqxqvszypkflcgjmjonynnchelabpgcfdzwdvqmkxtisscbsjagkunazykixdroujqkfiygvpwrbcudzsbjylypenhlhwlpcppb
Output: NO

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Letter Shuffle of the Rustic labels - EASY Coding Problem | CodeTikki