digit-frequency-score

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer <code>n</code>.

The score of <code>n</code> is defined as the sum of <code>d * freq(d)</code> over all distinct digits <code>d</code>, where <code>freq(d)</code> denotes the number of times the digit <code>d</code> appears in <code>n</code>.

Return an integer denoting the score of <code>n</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 122

Output: 5

Explanation:

<ul>
	<li>The digit 1 appears 1 time, contributing <code>1 * 1 = 1</code>.</li>
	<li>The digit 2 appears 2 times, contributing <code>2 * 2 = 4</code>.</li>
	<li>Thus, the score of <code>n</code> is <code>1 + 4 = 5</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: n = 101

Output: 2

Explanation:

<ul>
	<li>The digit 0 appears 1 time, contributing <code>0 * 1 = 0</code>.</li>
	<li>The digit 1 appears 2 times, contributing <code>1 * 2 = 2</code>.</li>
	<li>Thus, the score of <code>n</code> is 2.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>