# Make String A Subsequence Using Cyclic Increments: Interview Notes

Make String A Subsequence Using Cyclic Increments shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

You may add 1 (mod 26, wrapping z->a) to any characters of str1, each at most once, to make str2 a subsequence of str1. Two pointers: a character of str1 can match the next str2 character if it equals it or is the previous letter (one increment away).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n+m).

## Common mistake

Allowing more than one increment per character, or requiring a contiguous substring match.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at this tool.