Available question text
Determine whether by selecting any subset of positions in str1 and incrementing each chosen character once cyclically (a→b→...→z→a) you can make str2 a subsequence of str1. The core challenge is a greedy subsequence-matching decision where each str1 character can be used either as-is or as its one-step cyclic successor.
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
Amazon
Leetcode 2825. Make String a Subsequence Using Cyclic Increments
Reported Nov 12, 2024 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source