Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Append Characters to String to Make Subsequence

Explore a greedy two pointers technique to append the fewest characters to a source string so that a target string becomes its subsequence. Understand how to efficiently track character matches and calculate additions with O(n) time complexity and constant space.

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:

    ...