📘

Happy Number

A happy number is defined by repeatedly replacing it with the sum of squares of its digits until it either reaches 1 (happy) or loops endlessly (not happy).

Return True if n is a happy number.

Example:

Input:

Output:

True

Reasoning:

We start with the input number $19$ and calculate the sum of squares of its digits: $1^2 + 9^2 = 1 + 81 = 82$
Then, we repeat the process with $82$ : $8^2 + 2^2 = 64 + 4 = 68$
Next, we calculate the sum of squares of the digits of $68$ : $6^2 + 8^2 = 36 + 64 = 100$
Finally, we continue this process: $1^2 + 0^2 + 0^2 = 1$ , which is $1$ , so the number $19$ is happy, and we return $True$

Constraints:

1 <= n <= 2^31 - 1

Editor

Python 3.13.1

Test Results

0/0

Run code to see test results.