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.