3370. Smallest Number With All Set Bits

LeetCodeMathBit ManipulationOpen on judge ↗

You are given a positive number n. Return the smallest number x greater than or equal to n, such that the binary representation of x contains only set bits Example 1: Input: n = 5 Output: 7 Explanation: The binary representation of 7 is "111". Example 2: Input: n = 10 Output: 15 Explanation: The binary representation of 15 is "1111". Example 3: Input: n = 3 Output: 3 Explanation:

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