Available question text
Find an increasing sequence of indices in word1 of length |word2| such that the characters at those indices form a string that differs from word2 in at most one position, and return the lexicographically smallest such index array (or empty if none exists). This is a subsequence-selection problem with a one-mismatch constraint, requiring feasibility checks to choose the earliest valid indices.
Related questions
Continue with questions that share topics or the same question type.
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 3302. Find the Lexicographically Smallest Valid Sequence
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source