|@Rahul Jadhav 1||466|
Given a number N. The task is to find the length of the longest consecutive 1s in its binary representation.
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.
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).
1 <= N <= 106
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes