search

anuragverma108 / DSA-Placement-Probems

Welcome to the DSA Placement Problems repository, dedicated to helping individuals prepare for technical interviews at FAANG/MAANG companies. As part of the Hacktoberfest celebration, this open-source project invites contributions from the global programming community. The aim is to curate a comprehensive collection of data structures and algorithm
0 stars 1 forks source link

Next Happy Number #97

Closed extint closed 1 year ago

extint commented 1 year ago

Problem Statement: A number is called Happy if it leads to 1 after a sequence of steps. Wherein at each step the number is replaced by the sum of squares of its digits that is, if we start with Happy Number and keep replacing it with sum of squares of its digits, we reach 1 at some point. A recursive algorithm to find the next happy number of a given integer. @anuragverma108 please assign me this issue

extint commented 1 year ago

Heyy @anuragverma108 Actually on the website this pr shows as non participating. Could u help me to fix it please