Happy Number Algorithm | Dataford Interview Questions

Write an algorithm to determine whether a number is happy.

A happy number repeatedly replaces itself with the sum of the squares of its digits. Return True if the process eventually reaches 1; otherwise, return False when it enters a cycle that does not include 1.

Implement is_happy(n), which accepts a positive integer and returns a Boolean. For example, 19 is happy because 19 -> 82 -> 68 -> 100 -> 1, while 2 is not happy because its sequence cycles without reaching 1.

Constraints

1 <= n <= 2^31 - 1
The input is a positive integer
Return a Boolean value

Function Signature

def is_happy(n):

Your question is Happy Number Algorithm. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write an algorithm to determine whether a number is happy.

Constraints

1 <= n <= 2^31 - 1
The input is a positive integer
Return a Boolean value

Function Signature

def is_happy(n):

Your question is Happy Number Algorithm. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.