feat(leetcode): 2825 Make String a Subsequence Using Cyclic Increments

Author: 1chooo

leetcode/2825-make-string-a-subsequence-using-cyclic-increments/README.md

@@ -0,0 +1,52 @@
+## [2825. Make String a Subsequence Using Cyclic Increments](https://leetcode.com/problems/make-string-a-subsequence-using-cyclic-increments/)
+<p>You are given two <strong>0-indexed</strong> strings <code>str1</code> and <code>str2</code>.</p>
+
+<p>In an operation, you select a <strong>set</strong> of indices in <code>str1</code>, and for each index <code>i</code> in the set, increment <code>str1[i]</code> to the next character <strong>cyclically</strong>. That is <code>&#39;a&#39;</code> becomes <code>&#39;b&#39;</code>, <code>&#39;b&#39;</code> becomes <code>&#39;c&#39;</code>, and so on, and <code>&#39;z&#39;</code> becomes <code>&#39;a&#39;</code>.</p>
+
+<p>Return <code>true</code> <em>if it is possible to make </em><code>str2</code> <em>a subsequence of </em><code>str1</code> <em>by performing the operation <strong>at most once</strong></em>, <em>and</em> <code>false</code> <em>otherwise</em>.</p>
+
+<p><strong>Note:</strong> 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.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> str1 = &quot;abc&quot;, str2 = &quot;ad&quot;
+<strong>Output:</strong> true
+<strong>Explanation:</strong> Select index 2 in str1.
+Increment str1[2] to become &#39;d&#39;. 
+Hence, str1 becomes &quot;abd&quot; and str2 is now a subsequence. Therefore, true is returned.</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> str1 = &quot;zc&quot;, str2 = &quot;ad&quot;
+<strong>Output:</strong> true
+<strong>Explanation:</strong> Select indices 0 and 1 in str1. 
+Increment str1[0] to become &#39;a&#39;. 
+Increment str1[1] to become &#39;d&#39;. 
+Hence, str1 becomes &quot;ad&quot; and str2 is now a subsequence. Therefore, true is returned.</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> str1 = &quot;ab&quot;, str2 = &quot;d&quot;
+<strong>Output:</strong> false
+<strong>Explanation:</strong> 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.</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= str1.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= str2.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>str1</code> and <code>str2</code> consist of only lowercase English letters.</li>
+</ul>
+
+
+## Hints
+1. <div class="_1l1MA">Consider the indices we will increment separately.</div>
+2. <div class="_1l1MA">We can maintain two pointers: pointer <code>i</code> for <code>str1</code> and pointer <code>j</code> for <code>str2</code>, while ensuring they remain within the bounds of the strings.</div>
+3. <div class="_1l1MA">If both <code>str1[i]</code> and <code>str2[j]</code> match, or if incrementing <code>str1[i]</code> matches <code>str2[j]</code>, we increase both pointers; otherwise, we increment only pointer <code>i</code>.</div>
+4. <div class="_1l1MA">It is possible to make <code>str2</code> a subsequence of <code>str1</code> if <code>j</code> is at the end of <code>str2</code>, after we can no longer find a match.</div>

leetcode/2825-make-string-a-subsequence-using-cyclic-increments/solution.cpp

@@ -0,0 +1,34 @@
+/**
+ * Author: 1chooo<hugo970217@gmail.com>
+ * Problem: https://leetcode.com/problems/make-string-a-subsequence-using-cyclic-increments/
+ * Runtime: 0ms (100.00%)
+ */
+
+const static auto _ = []() {
+    cin.tie(nullptr)->sync_with_stdio(false);
+    return nullptr;
+}();
+
+class Solution {
+  public:
+    static bool canMakeSubsequence(string &str1, string &str2) {
+        const int sourceLength = str1.size(), targetLength = str2.size();
+        char currentTargetChar = str2[0];
+
+        int sourceIndex, targetIndex;
+        for (sourceIndex = 0, targetIndex = 0;
+             sourceIndex < sourceLength &&
+             targetIndex < targetLength;
+             sourceIndex++) {
+            char currentSourceChar = str1[sourceIndex];
+
+            if (currentSourceChar == currentTargetChar ||
+                currentSourceChar + 1 == currentTargetChar ||
+                (currentSourceChar == 'z' && currentTargetChar == 'a')) {
+                currentTargetChar = str2[++targetIndex];
+            }
+        }
+
+        return targetIndex == targetLength;
+    }
+};

leetcode/2825-make-string-a-subsequence-using-cyclic-increments/solution.go

@@ -0,0 +1,5 @@
+/**
+ * Author: 1chooo<hugo970217@gmail.com>
+ * Problem: https://leetcode.com/problems/make-string-a-subsequence-using-cyclic-increments/
+ * Runtime: ms (%)
+ */

leetcode/2825-make-string-a-subsequence-using-cyclic-increments/solution.py

@@ -0,0 +1,6 @@
+"""
+* Author: 1chooo<hugo970217@gmail.com>
+* Problem: https://leetcode.com/problems/make-string-a-subsequence-using-cyclic-increments/
+* Runtime: ms (%)
+"""
+