Please enter your email address or userHandle.
Given a number N. The task is to find the length of the longest consecutive 1s in its binary representation.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer N.
For each test case, in a new line, print the length of the longest consecutive 1's in N's binary representation.
1 <= T < 100
1 <= N <= 103
Testcase 1: Binary representation of 14 is 1110, in which 111 is the longest consecutive set bits and length is 3.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.