Deep in the tulip beds of Bloomhaven, Owen studies rows of charms 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| <= 41248; lowercase letters.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= |s|,|t| <= 41248; lowercase letters.
