C++ Data Structures and Algorithms

Checking whether a string is a subsequence of another string

We have successfully created code to generate subsequences of a string. Now we are going to create a C++ code to check if a string is a subsequence of another string. To do so, we will compare the character of two strings from the last character (the reason we compare from the last character of the string is the simplicity of checking the index against 0, rather than keeping track of the final index of both strings).

Suppose str1 is a subsequence of a string of str2, x is the index of str1, and y is the index of str2. It means that we will compare str1[x - 1] with str2[y -1]. If matched, continue until all suspected subsequence string characters have been checked. If not, compare ...