Posted on June 22, 2021June 22, 2021 Description Submission class Solution { public: bool isSubsequence(string s, string t) { int i = 0, j = 0; for(; i < s.length() && j < t.length(); ++j) { if(s[i] == t[j]) { ++i; } } return i == s.length(); } }; By Bill0412 Easy LeetCode