Find the position of the only set bit
Updated Apr 28, 2026
Short answer
Check if power of two, then take log2 or count shifts.
Deep explanation
This explores bitwise arithmetic and identity properties. Check if power of two, then take log2 or count shifts. These patterns are common in technical coding interviews.
Real-world example
Efficient memory allocation alignment checks.
Common mistakes
- Not handling the case where n = 0 for power-of-two checks.
Follow-up questions
- What is the time complexity?