Digit Counter

Given a non-negative integer n, count how many times each digit appears in its written form. Return a dictionary where each key is a digit as a string, and each value is the number of times that digit appears. Include only digits that actually occur in the number.

Примеры

Ввод
112233
Вывод
{"1": 2, "2": 2, "3": 2}
Ввод
0
Вывод
{"0": 1}
Ввод
1000
Вывод
{"0": 3, "1": 1}

Нужно реализовать

def digit_frequency(n: int) -> dict:

Теги

hashmapstrings
PostgreSQLv16

Koodin suorituksen tulos näkyy tässä

Tests12
Visible tests
Piilotettu testi 7
Piilotettu testi 8
Piilotettu testi 9
Piilotettu testi 10
Piilotettu testi 11
Piilotettu testi 12

They run when you press "Submit" — your whole solution is checked against them so you can't hard-code answers for the visible cases.

Focus radio
Paused · SomaFM · Fluid