Search
⌘K
Get Premium
Leetcode 2486. Append Characters to String to Make Subsequence
Given strings s and t, return the minimum characters to append to s so that t becomes a subsequence — equivalently, find the longest prefix of t that is a subsequence of s (using a greedy two‑pointer/linear scan) and return len(t) minus that matched length.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.