Given two strings
s is a subsequence of
A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e.,
"ace" is a subsequence of
"aec" is not).
Input: s = "abc", t = "ahbgdc" Output: true
Input: s = "axc", t = "ahbgdc" Output: false
0 <= s.length <= 100
0 <= t.length <= 104
tconsist only of lowercase English letters.
Follow up: Suppose there are lots of incoming
s1, s2, ..., skwhere
k >= 109, and you want to check one by one to see if
thas its subsequence. In this scenario, how would you change your code?