Sync LeetCode submission Runtime - 276 ms (39.72%), Memory - 28.4 MB (8.56%)

Author: jimit105

3451-string-compression-iii/README.md

@@ -0,0 +1,54 @@
+<p>Given a string <code>word</code>, compress it using the following algorithm:</p>
+
+<ul>
+	<li>Begin with an empty string <code>comp</code>. While <code>word</code> is <strong>not</strong> empty, use the following operation:
+
+	<ul>
+		<li>Remove a maximum length prefix of <code>word</code> made of a <em>single character</em> <code>c</code> repeating <strong>at most</strong> 9 times.</li>
+		<li>Append the length of the prefix followed by <code>c</code> to <code>comp</code>.</li>
+	</ul>
+	</li>
+</ul>
+
+<p>Return the string <code>comp</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">word = &quot;abcde&quot;</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">&quot;1a1b1c1d1e&quot;</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>Initially, <code>comp = &quot;&quot;</code>. Apply the operation 5 times, choosing <code>&quot;a&quot;</code>, <code>&quot;b&quot;</code>, <code>&quot;c&quot;</code>, <code>&quot;d&quot;</code>, and <code>&quot;e&quot;</code> as the prefix in each operation.</p>
+
+<p>For each prefix, append <code>&quot;1&quot;</code> followed by the character to <code>comp</code>.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">word = &quot;aaaaaaaaaaaaaabb&quot;</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">&quot;9a5a2b&quot;</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>Initially, <code>comp = &quot;&quot;</code>. Apply the operation 3 times, choosing <code>&quot;aaaaaaaaa&quot;</code>, <code>&quot;aaaaa&quot;</code>, and <code>&quot;bb&quot;</code> as the prefix in each operation.</p>
+
+<ul>
+	<li>For prefix <code>&quot;aaaaaaaaa&quot;</code>, append <code>&quot;9&quot;</code> followed by <code>&quot;a&quot;</code> to <code>comp</code>.</li>
+	<li>For prefix <code>&quot;aaaaa&quot;</code>, append <code>&quot;5&quot;</code> followed by <code>&quot;a&quot;</code> to <code>comp</code>.</li>
+	<li>For prefix <code>&quot;bb&quot;</code>, append <code>&quot;2&quot;</code> followed by <code>&quot;b&quot;</code> to <code>comp</code>.</li>
+</ul>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= word.length &lt;= 2 * 10<sup>5</sup></code></li>
+	<li><code>word</code> consists only of lowercase English letters.</li>
+</ul>

3451-string-compression-iii/solution.py

@@ -0,0 +1,23 @@
+# Approach: String Manipulation
+
+# Time: O(n)
+# Space: O(1)
+
+class Solution:
+    def compressedString(self, word: str) -> str:
+        comp = []
+
+        pos = 0
+
+        while pos < len(word):
+            consecutive_count = 0
+            current_char = word[pos]
+
+            while (pos < len(word) and consecutive_count < 9 and word[pos] == current_char):
+                consecutive_count += 1
+                pos += 1
+
+            comp.append(str(consecutive_count))
+            comp.append(current_char)
+
+        return ''.join(comp)