2825. Make String a Subsequence Using Cyclic Increments LeetCode Solution
In this guide, you will get 2825. Make String a Subsequence Using Cyclic Increments LeetCode Solution with the best time and space complexity. The solution to Make String a Subsequence Using Cyclic Increments problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
Problem Statement of Make String a Subsequence Using Cyclic Increments
You are given two 0-indexed strings str1 and str2.
In an operation, you select a set of indices in str1, and for each index i in the set, increment str1[i] to the next character cyclically. That is ‘a’ becomes ‘b’, ‘b’ becomes ‘c’, and so on, and ‘z’ becomes ‘a’.
Return true if it is possible to make str2 a subsequence of str1 by performing the operation at most once, and false otherwise.
Note: A subsequence of a string is a new string that is formed from the original string by deleting some (possibly none) of the characters without disturbing the relative positions of the remaining characters.
Example 1:
Input: str1 = “abc”, str2 = “ad”
Output: true
Explanation: Select index 2 in str1.
Increment str1[2] to become ‘d’.
Hence, str1 becomes “abd” and str2 is now a subsequence. Therefore, true is returned.
Example 2:
Input: str1 = “zc”, str2 = “ad”
Output: true
Explanation: Select indices 0 and 1 in str1.
Increment str1[0] to become ‘a’.
Increment str1[1] to become ‘d’.
Hence, str1 becomes “ad” and str2 is now a subsequence. Therefore, true is returned.
Example 3:
Input: str1 = “ab”, str2 = “d”
Output: false
Explanation: In this example, it can be shown that it is impossible to make str2 a subsequence of str1 using the operation at most once.
Therefore, false is returned.
Constraints:
1 <= str1.length <= 105
1 <= str2.length <= 105
str1 and str2 consist of only lowercase English letters.
Complexity Analysis
Time Complexity: O(n)
Space Complexity: O(1)
2825. Make String a Subsequence Using Cyclic Increments LeetCode Solution in C++
class Solution {
public:
bool canMakeSubsequence(string str1, string str2) {
int i = 0; // str2's index
for (const char c : str1)
if (c == str2[i] || ('a' + ((c - 'a' + 1) % 26)) == str2[i])
if (++i == str2.length())
return true;
return false;
}
}; /* code provided by PROGIEZ */
2825. Make String a Subsequence Using Cyclic Increments LeetCode Solution in Java
class Solution {
public boolean canMakeSubsequence(String str1, String str2) {
int i = 0; // str2's index
for (final char c : str1.toCharArray())
if (c == str2.charAt(i) || ('a' + ((c - 'a' + 1) % 26)) == str2.charAt(i))
if (++i == str2.length())
return true;
return false;
}
} // code provided by PROGIEZ
2825. Make String a Subsequence Using Cyclic Increments LeetCode Solution in Python
class Solution:
def canMakeSubsequence(self, str1: str, str2: str) -> bool:
i = 0 # str2's index
for c in str1:
if c == str2[i] or chr(
ord('a') + (ord(c) - ord('a') + 1) % 26) == str2[i]:
i += 1
if i == len(str2):
return True
return False # code by PROGIEZ
