Showing:
Handle Score
@Ibrahim Nash 5725
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4908
@saiujwal13083 4156
@sanjay05 3762
@marius_valentin_dragoi 3511
@sushant_a 3453
@KshamaGupta 3318
@the_coder95 3302
Longest Consecutive 1's
Easy Accuracy: 70.51% Submissions: 6814 Points: 2

Given a number N. The task is to 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 = 222
Output: 4
Explanation: Binary representation of 222 is
11011110, in which 1111 is the longest
consecutive set bits of length 4.



Your Task: The 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 <= 106