1532. Reformat The String
My accepted Python solution to LeetCode problem 1532, Reformat The String, running in 8ms.
- Difficulty: Easy
- Python
- Runtime 8ms
- Memory 17.3MB
- 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 8ms, memory 17.3MB, accepted 2025-12-29.
class Solution:
def reformat(self, s: str) -> str:
letters = [c for c in s if c.isalpha()]
digits = [c for c in s if c.isdigit()]
if abs(len(letters) - len(digits)) > 1:
return ""
if len(digits) > len(letters):
letters, digits = digits, letters
result = []
for i in range(len(digits)):
result.append(letters[i])
result.append(digits[i])
if len(letters) > len(digits):
result.append(letters[-1])
return ''.join(result)