Find The Group

CodeChefOpen on judge ↗

Given a base-$10$ integer, $n$, convert it to binary (base-$2$). Then find and print the base-$10$ integer denoting the maximum number of consecutive $1$'s in $n$'s binary representation. ###Input: A single integer, $n$. ###Output: Print a single base-$10$ integer denoting the maximum number of consecutive $1$'s in the binary representation of $n$. ###Constraints - $1 \leq n \leq 10^6$ ###Sam

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI