Given two strings s and t, return true if s is a subsequence of t, or false otherwise.

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 "abcde" while "aec" is not).

&nbsp;
Example 1:
Input: s = "abc", t = "ahbgdc"
Output: true
Example 2:
Input: s = "axc", t = "ahbgdc"
Output: false

&nbsp;
Constraints:


	0 &lt;= s.length &lt;= 100
	0 &lt;= t.length &lt;= 104
	s and t consist only of lowercase English letters.


&nbsp;
Follow up: Suppose there are lots of incoming s, say s1, s2, ..., sk where k &gt;= 109, and you want to check one by one to see if t has its subsequence. In this scenario, how would you change your code?
class Solution:
    def isSubsequence(self, s: str, t: str) -> bool:
        if len(s) > len(t):return False
        if len(s) == 0:return True
        subsequence=0
        for i in range(0,len(t)):
            if subsequence <= len(s) -1:
                print(s[subsequence])
                if s[subsequence]==t[i]:

                    subsequence+=1
        return  subsequence == len(s) 
class Solution 
{
    public boolean isSubsequence(String s, String t) 
    {
        int i,x,p=-1;
        if(s.length()>t.length())
            return false;
        for(i=0;i<s.length();i++)
        {
            x=t.indexOf(s.charAt(i),p+1);
            if(x>p)
                p=x;
            else
                return false;
        }
        return true;
    }
}
class Solution {
public:
    bool isSubsequence(string s, string t) {
        int n = s.length(),m=t.length();
        int j = 0; 
    // For index of s (or subsequence
 
    // Traverse s and t, and
    // compare current character
    // of s with first unmatched char
    // of t, if matched
    // then move ahead in s
    for (int i = 0; i < m and j < n; i++)
        if (s[j] == t[i])
            j++;
 
    // If all characters of s were found in t
    return (j == n);
    }
};
/**
 * @param {string} s
 * @param {string} t
 * @return {boolean}
 */
var isSubsequence = function(s, t) {
    for (let i = 0, n = s.length; i < n; i++)
        if (t.includes(s[i]))
            t = t.slice(t.indexOf(s[i]) + 1);
        else return false;
    
    return true;
}
Is Subsequence