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.
Asked at:
Amazon
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid November, 2024
Amazon
Junior
Password Similarity Check: Given two arrays of passwords, determine if each old password can be transformed into a subsequence of the corresponding new password by incrementing specific characters cyclically.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.