Solution: Append Characters to String to Make Subsequence
Understand how to determine the minimum number of characters to append to a source string to make a target string its subsequence. This lesson teaches a greedy two-pointer approach to efficiently match characters in order, helping you solve subsequence problems with linear time complexity and constant space.
We'll cover the following...
We'll cover the following...
Statement
You’re given two strings, source and target, made up of lowercase English letters. Your task is to determine the minimum number of characters that must be appended to the end of the source so that the target becomes a subsequence of the resulting string.
Note: A subsequence is formed by deleting zero or more characters from a string without changing the order of the remaining characters.
Constraints:
source.length,target.length...