Jun 22

Author: siddydutta

2025-06-June-LeetCoding-Challenge/Divide a String Into Groups of Size k.py

@@ -0,0 +1,20 @@
+class Solution:
+    def divideString(self, s: str, k: int, fill: str) -> list[str]:
+        s += fill * (-len(s) % k)
+        return [s[i: i + k] for i in range(0, len(s), k)]
+
+
+def main():
+    s = 'abcdefghi'
+    k = 3
+    fill = 'x'
+    assert Solution().divideString(s, k, fill) == ['abc', 'def', 'ghi']
+
+    s = 'abcdefghij'
+    k = 3
+    fill = 'x'
+    assert Solution().divideString(s, k, fill) == ['abc', 'def', 'ghi', 'jxx']
+
+
+if __name__ == '__main__':
+    main()

2025-06-June-LeetCoding-Challenge/README.md

@@ -25,7 +25,7 @@
 | June 19 | [2294. Partition Array Such That Maximum Difference Is K](https://leetcode.com/problems/partition-array-such-that-maximum-difference-is-k/) | Medium | Solved |
 | June 20 | []() |  |  |
 | June 21 | [3085. Minimum Deletions to Make String K-Special](https://leetcode.com/problems/minimum-deletions-to-make-string-k-special/) | Medium | Solved |
-| June 22 | []() |  |  |
+| June 22 | [2138. Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/) | Easy | Solved |
 | June 23 | []() |  |  |
 | June 24 | []() |  |  |
 | June 25 | []() |  |  |