Thousand Separator — LeetCode 1556 Python Solution

EasyString
Problem
#1556
Pattern
Hash Map
Reading time
2 min

The problem

Given an integer n, add a dot (".") as the thousands separator and return it in string format.

Example

Input
n = 987
Output
"987"

Python solution

Python
class Solution:
    def thousandSeparator(self, n: int) -> str:
        cnt = 0
        ans = []
        while 1:
            n, v = divmod(n, 10)
            ans.append(str(v))
            cnt += 1
            if n == 0:
                break
            if cnt == 3:
                ans.append('.')
                cnt = 0
        return ''.join(ans[::-1])

Complexity

MeasureComplexity
TimeO(n)
SpaceO(1) to O(n) auxiliary

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 1556. Thousand Separator is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Related problems

Frequently asked questions

How hard is LeetCode 1556. Thousand Separator?
LeetCode 1556. Thousand Separator is rated Easy on LeetCode.
What topics does LeetCode 1556. Thousand Separator cover?
LeetCode 1556. Thousand Separator is tagged String on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity — invisible to screen sharing.

Get Stealth Interview