Leetcode is an interview question bank for coding, which appears in varius tech companies. Today I will share how I tackle one of the questions.<\/p>\n\n\n\n
The question asks me to write an algorithm to determine if a number is happy. A happy number is a number defines by the following process:<\/p>\n\n\n\n
In short, write some code that returns true if n is a happy number, and false if not.<\/p>\n\n\n\n
Example 1:
Input: n = 19
Output: true
Explanation:
1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1<\/p>\n\n\n\n
Example 2:
Input n = 2
Output: false
Explanation:
2^2 = 4
4^2 = 16
1^2 + 6^2 = 37
3^2 + 7^2 = 58
5^2 + 8^2 = 89
8^2 + 9^2 = 145
1^2 + 4^2 + 5^2 = 42
4^2 + 2^2 = 20
2^2 = 4<\/p>\n\n\n\n
Let\u2019s start out with something easy. First, I create a variable \u2019total\u2019 to calculate the sum of the squares of its digits for 1 iteration.<\/p>\n\n\n\n
class Solution:\n def isHappy(self, n: int) -> bool:\n total = 0\n # find the number of digits of a number.\n length = len(str(n)) \n # do a for loop for the amount of times equal to the digits a number has.\n for i in range (length):\n # a number with modulus 10 is the last digit. Square it.\n total += (n%10)**2\n # integer division by 10 to find the second last digit, third last and so on.\n n = n\/\/10\n n = total\n<\/code><\/pre>\n\n\n\nI have used \u2019total\u2019 to store the first process of summation of squaring all the digits. However, we need to repeat the process. Using another for loop to repeat it 10 times first and view the results using print(). It will be changed to while loop after conditions of breaking the loop is set.<\/p>\n\n\n\n
class Solution:\n def isHappy(self, n: int) -> bool:\n # repeat 10 times as placeholder\n for j in range(10):\n total = 0\n # find the number of digits of a number.\n length = len(str(n)) \n # do a for loop for the amount of times equal to the digits a number has.\n for i in range (length):\n # a number with modulus 10 is the last digit. Square it.\n total += (n%10)**2\n # integer division by 10 to find the second last digit, third last and so on.\n n = n\/\/10\n # repeat the same process with previous result \n n = total\n print(total)\n<\/code><\/pre>\n\n\n\nThen, I add a flag to show if a number is happy number. It starts with False and change to true if total equals to 1.<\/p>\n\n\n\n
class Solution:\n def isHappy(self, n: int) -> bool:\n ishappynumber = False\n # repeat 10 times as placeholder\n for j in range(10):\n total = 0\n # find the number of digits of a number.\n length = len(str(n)) \n # do a for loop for the amount of times equal to the digits a number has.\n for i in range (length):\n # a number with modulus 10 is the last digit. Square it.\n total += (n%10)**2\n # integer division by 10 to find the second last digit, third last and so on.\n n = n\/\/10\n # repeat the same process with previous result\n n = total\n print(total)\n if total == 1:\n ishappynumber = True\n break\n return ishappynumber\n<\/code><\/pre>\n\n\n\nWriting a break condition if a number is not happy is more challenging. Most online solutions will use an if statement for n<10 because only 1 or 7 will return happy number. To me, the code should be making calculation for any number \u2019n\u2019, not just hardcoding logic for all numbers under 10. Therefore, my method will check if the number (not equal to 1) has appeared on the list of totals repeatedly. If so, the number is unhappy and the while loop is broken.<\/p>\n\n\n\n
class Solution:\n def isHappy(self, n: int) -> bool:\n ishappynumber = False\n # initialise the list of totals \n recordtotal = []\n # infinite loop\n while True:\n total = 0\n # find the number of digits of a number.\n length = len(str(n)) \n # do a for loop for the amount of times equal to the digits a number has.\n for i in range (length):\n # a number with modulus 10 is the last digit. Square it.\n total += (n%10)**2\n # integer division by 10 to find the second last digit, third last and so on.\n n = n\/\/10\n # repeat the same process with previous result\n n = total\n print(total)\n if total == 1:\n ishappynumber = True\n break\n if total in recordtotal:\n break\n recordtotal.append(total)\n return ishappynumber\n<\/code><\/pre>\n\n\n\nAlthough it is slower for the program to calculate if a number is happy, it is less hard coded and shows results based on calculation.<\/p>\n","protected":false},"excerpt":{"rendered":"
Morgan Ho 2025\/06\/13 Leetcode Leetcode is an interview question bank for coding, which appears in varius tech companies. Today I will share how I tackle one of the questions. The question The question asks me to write an algorithm to determine if a number is happy. A happy number is a number defines by the […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-7","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/bitwonton.com\/index.php?rest_route=\/wp\/v2\/posts\/7","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/bitwonton.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/bitwonton.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/bitwonton.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/bitwonton.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=7"}],"version-history":[{"count":1,"href":"https:\/\/bitwonton.com\/index.php?rest_route=\/wp\/v2\/posts\/7\/revisions"}],"predecessor-version":[{"id":8,"href":"https:\/\/bitwonton.com\/index.php?rest_route=\/wp\/v2\/posts\/7\/revisions\/8"}],"wp:attachment":[{"href":"https:\/\/bitwonton.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=7"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/bitwonton.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=7"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/bitwonton.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=7"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}