@@ -0,0 +1,971 @@
+/**%0A * Given a string s and a string t, check if s is subsequence of t.%0A * You may assume that there is only lower case English letters in both s and t. %0A * t is potentially a very long (length ~= 500,000) string, and s is a short string (%3C=100).%0A * A subsequence of a string is a new string which is formed from the original string by deleting some %0A * (can be none) of the characters without disturbing the relative positions of the remaining characters. %0A * (ie, %22ace%22 is a subsequence of %22abcde%22 while %22aec%22 is not).%0A */%0Apublic class Solution %7B%0A  public boolean isSubsequence(String s, String t) %7B%0A    // An empty string is a subsequence of everything.%0A    if (s.length() == 0) return true;%0A    // There are no subsequences of an empty string.%0A    if (t.length() == 0) return false;%0A%0A    int k = 0;%0A    for (int i = 0; i %3C t.length(); i ++) %7B%0A      if (t.charAt(i) == s.charAt(k)) k ++;%0A      if (k %3E= s.length()) return true;%0A    %7D%0A%0A    return k %3E= s.length();%0A  %7D%0A%7D

Add 392 :tada: