Happy Number
Write an algorithm to determine if a number n is happy. A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits. Repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy.
Happy Number
Write an algorithm to determine if a number n is happy. A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits. Repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy.
Example 1
Input: n = 19 Output: true
Example 2
Input: n = 2 Output: false
Show hint
Use a set to detect cycles. Calculate sum of squares of digits repeatedly. If sum is 1, return true. If sum seen before, return false.
Sign in to submit, save progress and mark problems as solved. You can still run your code.
Loading editor...
19
true