In this tutorial, I have explained Happy Number LeetCode Solution using java code. The tricky part in this problem is to detect a loop.
Happy Number Java Code - https://webrewrite.com/happy-number/
LeetCode 30 Day Challenge PlayList - https://www.youtube.com/watch?v=-I1pUv57WG8&list=PLUg9hRlm7gxT8mrwa_648iC8Ah42E0W1o
Write a code to determine if a number is "happy" or not.
In this tutorial, I have explained how to check whether an input number is happy number or not.
What is happy number?
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.
Example 1:
Input : 19
output : true
1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1
Example 2:
Input : 20
Output : false
2^2 + 0^2 = 4
4^2 = 16
1^2 + 6^2 = 37
3^2 + 7^2 = 58
5^2 + 8^2 = 145
1^2 + 4^2 + 5^2 = 42
4^2 + 2^2 = 20 (Loop occurs)
This problem is the day 2 challenge of LeetCode 30 day challenge.
Website - https://webrewrite.com/
Paypal - https://www.paypal.me/programmingtutorials
