Easy 0 solved 0% acceptance

Happy Number

Decide whether repeatedly summing the squares of the digits of a number reaches 1.

What you'll learn

  • Compute the sum of squared digits
  • Detect a repeating sequence with a set or two pointers
  • Stop a loop on either of two conditions

Problem

Start with a positive integer and replace it by the sum of the squares of its digits. Keep doing that. If the number eventually becomes 1, the starting number is happy. Otherwise the process falls into a loop that never contains 1, and the number is unhappy. For example, 7 → 49 → 97 → 130 → 10 → 1, so 7 is happy.

Implement happy_number(n).

You need a way to notice that the sequence has started repeating, so the loop stops on unhappy numbers too.

Input

n: The starting number.

Output

Return true if the process reaches 1, otherwise false. The number 1 itself is happy.

Constraints

1 ≤ n ≤ 10^9

Examples

Example 1
Input:
n = 19

Expected output:
expected = True
Input:
long long n = 19;

Expected output:
bool expected = true;
Input:
long n = 19;

Expected output:
bool expected = true;

Explanation

1² + 9² = 82, then 8² + 2² = 68, then 6² + 8² = 100, then 1² + 0² + 0² = 1, so 19 is happy: true.

Example 2
Input:
n = 4

Expected output:
expected = False
Input:
long long n = 4;

Expected output:
bool expected = false;
Input:
long n = 4;

Expected output:
bool expected = false;

Explanation

4 → 16 → 37 → 58 → 89 → 145 → 42 → 20 → 4 repeats without ever reaching 1, so the answer is false.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Write a helper that maps a number to the sum of the squares of its digits.

Hint 2

An unhappy number repeats a value it has already produced; remember the values you have seen.

Hint 3

The sequence drops below a few hundred very quickly, so the set stays small.

Expected complexity

O(log n) steps per number, O(1) extra space with two pointers

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.