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).
How do I solve it
Breakdown:
Sequentially search through the second string.
Each iteration of search goes using the current character of iteration in the first string.
If the character is found in correct sequence, we increase the searching index for the first string.
What is this problem
How do I solve it
Breakdown: