Leetcode 2825. Make String a Subsequence Using Cyclic Increments

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.