Solution: Is Subsequence
Explore the two-pointer approach to determine whether a string s is a subsequence of another string t. Learn to efficiently scan both strings, matching characters in order to solve the problem in linear time with constant space.
We'll cover the following...
We'll cover the following...
Statement
Given two strings s and t, determine whether s is a subsequence of t. Return TRUE if it is, or FALSE otherwise.
A subsequence of a string is a new string formed by deleting zero or more characters from the original string, without changing the relative order of the remaining characters. For example, "ace" is a subsequence of "abcde", whereas "aec" is not.
Constraints: