Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given a number **N. **Find the length of the longest consecutive 1s in its binary representation.

**Example 1:**

**Input**: N = 14
**Output**: 3
**Explanation**:
Binary representation of 14 is
1110, in which 111 is the longest
consecutive set bits of length is 3.

**Example 2:**

Input: N = 222Output: 4Explanation: Binary representation of 222 is 11011110, in which 1111 is the longest consecutive set bits of length 4.

You don't need to read input or print anything. Your task is to complete the function **maxConsecutiveOnes**() which **returns **the **length **of the **longest ****consecutive **1s in the binary representation of given N.

**Expected Time Complexity:** O(log N).

**Expected Auxiliary Space:** O(1).

**Constraints:**

1 <= N <= 10^{6}

1 <= N <= 10

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Longest Consecutive 1's

...