search

GDSC-IGDTUW-Autumn-of-Code-2022 / dsa-foundation

To submit questions and answers for DSA.
5 stars 44 forks source link

HAPPY NUMBER #132

Closed KanchanBora closed 8 months ago

KanchanBora commented 1 year ago

Write an algorithm to determine if a number n is happy.

The number should start with positive integer Replace the number by the sum of the squares of its digits. Repeat until the number= 1 The numbers for which process ends with 1 are happy.

@Parul-Mann @gdsc-igdtuw Please assign me this issue.

gh4abhi commented 1 year ago

Please assign this issue to me.

Monachaudhary commented 1 year ago

Kindly assign this to me.

ssom01-github commented 1 year ago

Please assign the issue to me