Nov 4

Author: siddydutta

2024-11-November-LeetCoding-Challenge/README.md

@@ -6,7 +6,7 @@
 | November 1  | [1957. Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/) | Easy | Solved |
 | November 2  | [2490. Circular Sentence](https://leetcode.com/problems/circular-sentence/) | Easy | Solved |
 | November 3  | [796. Rotate String](https://leetcode.com/problems/rotate-string/) | Easy | Solved | 
-| November 4  | []() |  |  |
+| November 4  | [3163. String Compression III](https://leetcode.com/problems/string-compression-iii/) | Medium | Solved |
 | November 5  | []() |  |  |
 | November 6  | []() |  |  |
 | November 7  | []() |  |  |
@@ -38,5 +38,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 3 | 3 | 0 |
-| Medium | 0 | 0 | 0 |
+| Medium | 1 | 1 | 0 |
 | Hard   | 0 | 0 | 0 |

2024-11-November-LeetCoding-Challenge/String Compression III.py

@@ -0,0 +1,30 @@
+class Solution:
+    def compressedString(self, word: str) -> str:
+        curr_count = 0
+        curr_char = None
+        comp = ''
+        for ch in word:
+            if ch != curr_char:
+                if curr_char is not None and curr_count > 0:
+                    comp += f'{curr_count}{curr_char}'
+                curr_char = ch
+                curr_count = 1
+            else:
+                curr_count += 1
+                if curr_count == 9:
+                    comp += f'{curr_count}{curr_char}'
+                    curr_count = 0
+        comp += (f'{curr_count}{curr_char}' if curr_count > 0 else '')
+        return comp
+
+
+def main():
+    word = 'abcde'
+    assert Solution().compressedString(word) == '1a1b1c1d1e'
+
+    word = 'aaaaaaaaaaaaaabb'
+    assert Solution().compressedString(word) == '9a5a2b'
+
+
+if __name__ == '__main__':
+    main()