[LeetCode/Python] 68. Text Justification

📌 Problem

[LeetCode] 68. Text Justification

📌 Solution

class Solution:
    def isSubsequence(self, s: str, t: str) -> bool:
        i, j = 0, 0
        while i < len(s) and j < len(t):
            if s[i] == t[j]:
                i += 1
            j += 1
        return i == len(s)