10340 - All in All
Given two strings s and t, you have to decide whether s is a subsequence of t, i.e. if you can remove characters from t such that the concatenation of the remaining characters is s.
This problem is simply checking for substrings and is straightforward to implement.
- The string lengths are arbitrarly long - be sure to use a dynamically allocated buffer rather than a fixed array.
- Anything special to note about the problem.
sequence subsequence person compression VERDI vivaVittorioEmanueleReDiItalia caseDoesMatter CaseDoesMatter
Yes No Yes No
- Reference 1