CT33330

Potter and the Crimson riddles

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

The accountant Potter has been asked to outscore the rival chapter. On the desk lies a long table of riddles readings. Task: Print YES if s is a subsequence of t (its characters appear in t in order, not necessarily contiguously), otherwise NO. Input format: Two lines: string s, then string t. Output format: Print YES or NO. Constraints: 1 <= |s|,|t| <= 32989; lowercase letters.

Example 1:

Input: kornh dvgqrggzahpasnnceesecnxceresqyllslswyzlpebvqdsypewvaqijdxndmevfnjshqzbuzofmljlncnxrtxcwhibiphpjvwoqzuvfwensmrxjiiqbajccjyrfbqfiqqciqnvsyezgeswmnmbgviscijmqzrprjbpcxcupycfulatcrsdhwvcrfzkuiuwilpkkepcmuigwevifrmdloeetfataviizjlryqzwwiyqfrmouplgzjdtbeozibsdbkvxilzkepqrtkxgyaexhvkychxxnbnvwuugqmidbfjmcjxuijmecuorwdfzbisswmirnigelymvxgiidsvhtruwqkdzaltlminsplgppxnkopbparhtrdkghhjeckmmlxomvhhdohrkidwzuayjlxkpxrborujyuazcxtxzsuncjovsszgseifsowvsecipokzfptrpjelgpnqvonxfpkfxnhgzbboapzuzgsnarusowoctzmekqhcenujukanmtqpakyxnvfbibaoaigtwwutipvhnrhagfecnfdgbtwkxgaalqmmprukacgvimpcfescgnbylykyxgzqeeerbvevdcztvmcboihsewgmpzmzstsbrhhtkiutxhvfibvvienfakgqkllotmmhidivdnobmdxiushtusewcauifgsghykxiezpmxjunammnbxfptzsrjtlidnxplwiutggrbsfqzgwhpxvlqpbatqzixupxnsuwopqwjfeagxvqahevoxrsxdrxbxudkuivofdlojeaeyaw…
Output: YES

Example 2:

Input: ld cnmwldjpghudmuqjoamseyccnvwtaarbrrnwjiklkxtonenbjweqnkxqzbpprlnqxbiqpuleloxribdtrkiaujwfsjnsizztdnsquwmycapixqokmofiwzzydweplqivgrdsbyohlqgkdnedrhcplrdbinrtaatmjiwtlmmfxyfbzqujvaeknplktrptgnninsvdgtfdmujrvkhvvvsjdwwcslomdupadhcmghdzqsujkztuweqcgrdnefrfxvzlhjtcayqabyfkuhrakscfcujvzxdqkoezyonlipknchqxjbvlpuvjghylenvsbfdhsdkgwstsetsfgigqihsmttymvcmbzsxhoqxozdpibzktdttynubebjybblmcpabdoceoletwgxgyjztbegqclwhyluaeoqolpgbqijppyaphvwaysgheakhzfxyhgxupbfjhyjsaqdvmaqpethdokdcbfempznucfrhkqlnpgcwaksnotnydedwpfnygehmcgbhhnnwfeymhtxcziedkitowngyolhaozmxwkxtgswhosreruqlbmajzkwrinmvvfzypbkdwrjyicmgtmrmrrgysublqdgvcgtpjsnevbtsbwhtqfmizwiusshrpkcnxaliynjxuytohllbfzdgalzxuseukvszaejpjkpdrrymzlkhjlpcvldehbniqgqmubrzbdvqmqjnnevzmvbxiyqtpdgbwwuhlaqmsbwijvfhhileldymsezqydfootmbqmohkjitqivdrobijivndnukjanmig…
Output: YES

Example 3:

Input: k sveheldcqviemosygezndtysarvgwuj
Output: NO

Constraints:

1 <= |s|,|t| <= 32989; lowercase letters.

Loading...
Test Cases:No test cases
No test cases available.
Potter and the Crimson riddles - MEDIUM Coding Problem | CodeTikki