3950. Exactly One Consecutive Set Bits Pair

LeetCodeBit ManipulationOpen on judge ↗

You are given an integer n. Return true if its binary representation contains exactly one adjacent pair of set bits, and false otherwise. Example 1: Input: n = 6 Output: true Explanation: - Binary representation of 6 is 110. - There is exactly one adjacent pair of set bits ("11"). Thus, the answer is true. Example 2: Input: n = 5 Output: false Explanation: - Binary representat

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