Append Characters to String to Make Subsequence: coding question

Available question text

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.

Continue with questions that share topics or the same question type.

Delete Characters to Make Fancy String
Coding
Make String a Subsequence Using Cyclic Increments
Coding
Rearrange Characters to Make Target String
Coding
Apply Operations to Make String Empty
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

No company association
Leetcode 2486. Append Characters to String to Make Subsequence
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

Append Characters to String to Make Subsequence

Available question text

Related questions

Append Characters to String to Make Subsequence

Available question text

Related questions