CT27055

The scrolls at Sleekwater

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Deep in the otter slides of Sleekwater, Rosa studies rows of scrolls entries. One clean number will settle the guild's oldest argument. 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| <= 1011; lowercase English letters.

Example 1:

Input: gzlodqdjtllwgvplawtmhnyaitmkcsopvfyyydkjszughkjfeshvxzrlolzlwfqkvrbivbfkygwhuukaeffwoqtwuhflokurzzgyfhukmuagzerdcmqjaxdscibrvrgaonahtvvajsqzesobdccnbvgdqscqyphrfcydhdmvmnreealwvgtekhosmfrciyaivzmhqnampabmimgvaaoewabveogogksjdnhajhsjosmmobrrsdwmltvrxubkyzlpthnaidguhzpahsctqpqdkhtubqixxntqxxyruhxidinjunofdysdkcpfdfumzklnrqasophzjjddnvbdekytybeyobxwkqedhlptlnddlglahwmfnyjgxvjljoxnabuahoqtafbohgi ymxdcublhlnxcggxnsmmhiyoifyaweqwfdgackqlorjjhuusddgdulrmdvdzfoqjyyhdctbkraqpnhaftnnydsfirubkehmylnnpvdhtpuhtttysrdvqohmpucjjkhzrbfelwxlroyahgegpkoeykykizoiaczmaqmhwsaeszhegodmlnquioyrgksulhqbqvbhsmhzxajvckotzmewjhtuvmaosjajvuvohwnxdvjgltqbyznmpelhdavdxfqfbqbkidqirztpynbbbdktszmwdhyonanfoloknvwqlrirdoxavagnxuutrahrdsbblogklagiofzajpbtejapfzgcvmuhpzasefqatjlxdakciokwwhvdfjclkggsavsfyvmxfewvdrgs
Output: YES

Example 2:

Input: m m
Output: YES

Example 3:

Input: fgjqjuwfsddjyaizxczdkwligosseoxfaauqjbtrccsgbsmxmhcyhbegdspbacunbrcfijimglfghugzosuehrelcgejmlbhgaawpxkseejpvzmevjwyswvtwcpevkotrlvdwvupgenptebmrmkwlnedjgmvijbvhlcgrvcqdsspzgxiwcskpgbuapjffxffplupjmqhvraetoishkvrwkaeqexaomhnenmgkhlbkzgayklmvbebyrqtzaiaihzdheyqnvmsvefpgmvidajoardkfgziaiqoztokoeaevpzonefbxwaayygbtoygtklnkdnqlkbyvlcjshzbkseeaaazbpujijhwrojqyhfvakaftenojyuxocojhiabwlazecqxlkhnhzgvrsjhafuelbzvcwttinnevksotjwabrbsmivlxtzzugdfvykgkzrvrelexqrgvcuyzplzvlojsmolmsmysqusukuugdflqqfqeuhdplbbgufysdrpebhmxwtnnnpmtyulinoohjyxspqxljemegylurfggrxrnjtayvvkwothtixxpbmnxmkklurpyaxhktuncfuneakfdduyhukpaodwfrnecphgemllncvqdcpkemlndisdyegikswczgxektzpdssnlqjkiwzvwhogbddgqcijdofuoosdltdibyiitbfgbattpbdqxafmwswhpfyghwaxwxtkuzcnwsxowdrcupetpmphnneqxwrnlqpjijpukxyhllpoeytagwdyvyggadgsbjtgzhbzpkrjwmga…
Output: YES

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The scrolls at Sleekwater - EASY Coding Problem | CodeTikki