Is Subsequence LeetCode solution in Python

1
class Solution:
2
def isSubsequence(self, s: str, t: str) -> bool:
3
if len(s) > len(t):
4
return False
5
if len(s) == 0:
6
return True
7
subsequence = 0
8
for i in range(0, len(t)):
9
if subsequence <= len(s) - 1:
10
print(s[subsequence])
11
if s[subsequence] == t[i]:
12

13
subsequence += 1
14
return subsequence == len(s)

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0