CT23489

Asha's Scattered Match Ledger

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Deep in the river town of Willowford, Asha studies rows of ribbons entries. One clean number will settle the guild's oldest argument. 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| <= 1394; lowercase letters.

Example 1:

Input: zh kzcftzslwzzehsgygwzn
Output: YES

Example 2:

Input: bgqzmlc eozqavtyaagqxudjcjmvoswxlokblbgwbkcphadjkhorpgsneqqpgnivbzrxhnuttvqznmqxzmswpmlruklwvvchdyvtpfctzxzcshkhfgmonyprxxuplznfjmvqiwzmanvyghugygwfizxygnaaanrzpvtyuzfvflvrgsmszbhgidjgghfkhegbyrseahmwdlcrvimgyypzwuaiygpjgfaogqbaglcocglgswqvlapndchlujhwemrjvpjtoukiggcbdnwaahfxbdjwrikoltlyrsibojgmjefatxoksvuoqvuwodjnulepzvkj
Output: YES

Example 3:

Input: ddzwfdy buspkockminhkiisszhnkolrptgqyioqnbixclcmepnklgvcgnmfhhhdwxiyylkoralzgqgjnddxqiaixoegaiygbwuqtueqcodvoablkibvuxdsznkmwpjxksmprhcepvenjxyfvtchjvwlfknzecqajipllbkkzqijboxlbbmxhcotdmxgtxamoqckasoxcbkcqaaeguywivrlmiqyjexdrxojzmgmqzilhaqvbchtjahjzvyiqwdhtiwixbnphjgoohdbizbijhinorzonyynnrmvzfydjdlqtnekxemdwelkjdgnbryjpojopxxzhwsptytvvuvdajnbhpmxdiymzsdbpaaptetyfmrpopjxxjlgqkfibznraaxrzzhhctcjzxdbzofqzatghdzxxxeklmjnpamgvuingjvuvbgjjdpxgywcwytzcvbnwgbixhtnpeeizxkqspddxoyeelpixbdazfvxlgyaimnjcbicuxjtolxavyoioiuzygblhzdzqgoucakjhsjydazbvowbqmncqnpbkgzzxcmbhzlnvntkmlfgombsegzsanptpbpzxmkfvnfzgazuibniubkgypkddlktvdmyrnvlopgukwljsogabeyvymolceiftxiivcfgwnfqwvgovrknuijsfwbkcxcxzlubhikpkdvuzsjwbtnmwgsmgjpdhsfrculqhlnvvnylcltpaxvzaabkqvtvtjfzeulcuwmlbtjewynprceumeilfovkynqadkhblglaqsheubhjqokrwkpr…
Output: YES

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Asha's Scattered Match Ledger - EASY Coding Problem | CodeTikki