solves happy number in python

Author: anishLearnsToCode

Diff for: README.md

@@ -56,7 +56,7 @@
 | 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ReverseBits.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/reverse_bits.py) | 
 | 191 | [Number of One Bits](https://leetcode.com/problems/number-of-1-bits) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NumberOf1Bit.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/number_of_1_bits.py) |
 | 198 | [House Robber](https://leetcode.com/problems/house-robber) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/HouseRobber.java) |
-| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/HappyNumber.java) | 
+| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/HappyNumber.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/happy_number.py) | 
 | 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/RemoveLinkedListElements.java) |
 | 204 | [Count Primes](https://leetcode.com/problems/count-primes) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/CountPrimes.java) |
 | 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/IsomorphicStrings.java) |

Diff for: python/happy_number.py

@@ -0,0 +1,12 @@
+class Solution:
+    def _is_happy(self, number: int, previously_used: set) -> bool:
+        if number is 1:
+            return True
+        new_number = sum(int(digit) ** 2 for digit in str(number))
+        if new_number in previously_used:
+            return False
+        previously_used.add(new_number)
+        return self._is_happy(new_number, previously_used)
+
+    def isHappy(self, n: int) -> bool:
+        return self._is_happy(number=n, previously_used={n})