392. Is Subsequence Posted on 2020-01-07 In Leetcode Easy to solve. Just don’t forget the corner case. 12345678910111213class Solution: def isSubsequence(self, s: str, t: str) -> bool: n = 0 if not s: return True if not t: return False for i in t: if s[n] == i: n += 1 if n == len(s): return True return False