Geeksforgeeks Solution For " Happy Number "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Happy Number 

Submit Your Solution :- Click Here 

Solution :- 

#include <bits/stdc++.h>
using namespace std;
int numSquareSum(int n)
    int squareSum = 0;
    while (n)
        squareSum += (n % 10) * (n % 10);
        n /= 10;
    return squareSum;
bool isHappynumber(int n)
    int slow, fast;
    slow = fast = n;
        slow = numSquareSum(slow);
        fast = numSquareSum(numSquareSum(fast));

    while (slow != fast);
    return (slow == 1);
int main()
    int t;
    int n;
    if (isHappynumber(n))
        cout <<"1\n";
        cout <<"0\n";
    return 0;


Geeksforgeeks Solution For " Happy Number "

Previous Post
Next Post

post written by:

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me