How to solve this problem from gfg

#1

https://practice.geeksforgeeks.org/problems/next-happy-number/0

#2

@Somith
You just have to find next number for which the sum of square of digits is equal 1.
So just keep doing the sum square of digits for number n, then keep checking till it is 1 or not. if its 1 then return n.

#3

can u pls sen the code

#4

@Somith can you please once see the code at geeksforgeeks itself for this question, i just checked it there, and my code will be almost same and not vary much.
Let me know if you still need the code, i will write it for you.