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).

Example 1:

Input: s = "abc", t = "ahbgdc"
Output: true

Example 2:

Input: s = "axc", t = "ahbgdc"
Output: false

Constraints:

• 0 <= s.length <= 100

• 0 <= t.length <= 10<sup>4</sup>

• s and t consist only of lowercase English letters.

Solution:

Language: Java

class Solution 
{
    public boolean isSubsequence(String s, String t) 
    {
        if(s.length()>t.length())
        return false;
        int i=0;
        int j=0;
        while(i<s.length() && j<t.length())
        {
        if(t.charAt(j)==s.charAt(i))
          i++;
          j++;
        }
        return (i==s.length());
    }
}