Happy Number

[utchak160]

Description 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

@akshitagit can I work on this algorithm as part of Hactoberfest?

[utchak160]

Thanks

[Rituraj-commits]

Hello @utchak160 @akshitagupta15june . Would love to solve this problem. Can you assign it to me ?

[Sambhu98]

I would like to work on this problem.Can you assign it to me?

[ayerhs7]

I have already done this problem. Please assign this to me

[guptaa98]

i've done this problem! please assign this to me.

[kedhar0608]

Please assign this to me

[suraakhila1]

please assign this issue to me sir.