202 ready

Author: OfficialCodeVoyage

202 Happy Number/solution.py

@@ -0,0 +1,41 @@
+###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.
+# Return true if n is a happy number, and false if not.
+#
+#
+#
+# Example 1:
+#
+# Input: n = 19
+# Output: true
+# Explanation:
+# 12 + 92 = 82
+# 82 + 22 = 68
+# 62 + 82 = 100
+# 12 + 02 + 02 = 1
+
+
+n = 18
+
+def happynumber(n) -> bool:
+    seen = set()
+
+    while n != 1 and n not in seen:
+        seen.add(n)
+        n = sum(int(i) ** 2 for i in str(n))
+
+    return n == 1
+
+
+
+    # if result == 1 -- > return True
+
+
+print(happynumber(n))
+
+