Happy Number · Coding Interview Practice

Happy NumberA number is happy if repeatedly replacing it by the sum of the squares of its digits eventually reaches 1. Return true if n is happy.Constraints

1 <= n <= 2^31 - 1

Examples

Input: n = 19 Output: true

Input: n = 2 Output: false

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…