Given two strings s and t, return true if s is a subsequence of t: if you can get s by deleting some (or none) of the characters of t without changing the order of the rest.
Examples
Example 1
- Input
- s = "abc", t = "ahbgdc"
- Output
- true
Example 2
- Input
- s = "axc", t = "ahbgdc"
- Output
- false
- Why
- There's no x in t.
Constraints
0 <= s.length <= 1000 <= t.length <= 10^4- Both strings contain only lowercase English letters.