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>

Weekly Contest 504

weekly-contest-504

digitFrequencyScore

Mid Level

Digit Frequency Score

Hash Table

Math

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

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 score of n is 1 + 4 = 5.

Example 2:

Input: n = 101

Output: 2

Explanation:

 * The digit 0 appears 1 time, contributing 0 * 1 = 0.
 * The digit 1 appears 2 times, contributing 1 * 2 = 2.
 * Thus, the score of n is 2.

 

Constraints:

 * 1 <= n <= 109