Given two strings s and t, return 'true' if s is a subsequence of t, and 'false' otherwise.
A subsequence is a string derived from another string by deleting some or no characters without changing the relative order of the remaining characters.
Input: Two comma-separated strings: s and t.
Output: Return 'true' if s is a subsequence of t, otherwise 'false'.
Input: abc,ahbgdc
Output: true
Explanation: a→h(skip)→b→g(skip)→d(skip)→c → found all of 'abc' in order.Input: axc,ahbgdc
Output: false
Explanation: After matching 'a' and needing 'x', 'x' is never found in t.Input: ,ahbgdc
Output: true
Explanation: Empty string is a subsequence of any string.0 <= s.length <= 1000 <= t.length <= 10^4s and t consist of lowercase English letters