3945. Digit Frequency Score

LeetCodeHash TableMathOpen on judge ↗

You are given an integer n. The score of n is defined as the sum of d * freq(d) over all distinct digits d, where freq(d) denotes the number of times the digit d appears in n. Return an integer denoting the score of n. Example 1: Input: n = 122 Output: 5 Explanation: - The digit 1 appears 1 time, contributing 1 * 1 = 1. - The digit 2 appears 2 times, contributing 2 * 2 = 4. - Thus, the

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI