Geeksforgeeks Solution For " Longest Consecutive 1's "

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 :- Given a number N, Your task is to find the  length of the longest consecutive 1's in its binary representation.

Submit Your Solution :- Click Here 

Solution :- 

using namespace std;

int maxConsecutiveOnes(int x)
    int count = 0;
    while (x!=0)
        x = (x & (x << 1));


    return count;
int main()
int t;
    int n;
    cout << maxConsecutiveOnes(n) << endl;
    return 0;


Geeksforgeeks Solution For " Longest Consecutive 1's "

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