Thursday, 6 April 2017

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 :- 

#include<bits/stdc++.h>
using namespace std;

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

        count++;
    }

    return count;
}
int main()
{
int t;
    cin>>t;
    while(t--)
    {
    int n;
    cin>>n;
    cout << maxConsecutiveOnes(n) << endl;
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Longest Consecutive 1's "

No comments:
Write comments

Recommended Posts × +