2260. Divide a String Into Groups of Size k
My accepted Python solution to LeetCode problem 2260, Divide a String Into Groups of Size k, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.1MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.1MB, accepted 2026-01-01.
class Solution:
def divideString(self, s: str, k: int, fill: str) -> List[str]:
remainder = len(s) % k
if remainder != 0:
s += fill * (k - remainder)
return [s[i:i+k] for i in range(0, len(s), k)]