Happy Number Python 202 Leetcode | Google Interview question

🔴 Question Link -

✅Connect with me

🔴 Question with Example:
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, and 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 numbers.

Return True if n is a happy number, and False if not.

Example:

Input: 19
Output: true
Explanation:
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1

[DivineSam-wm]

Better video quality would have been amazing...still amazingly helpful

[roopendrasingh]

My Solution
# 202. Happy Number
OO = 91

def get_happy(n, seen = set()):
Sum = 0
for i in str(n):
Sum = Sum + int(i)**2
if Sum == 1:
return True
elif Sum in seen:
return False
seen.add(Sum)
return get_happy(Sum, seen)


k = get_happy(OO)
if k:
print('Number is happy')
else:
print('Number is NOT happy')