Contribute to Ney2/LeetCode_75 development by creating an account on GitHub.

Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) string, ...