Dsa
Bit Manipulation
Medium
Single Set Bit Check
Given a list of integers, determine how many of those integers have exactly one bit set to 1 in their binary representation. Print the count of such integers.
Example:
Input:
1 2 4 8 3 16
Output:
4
(The integers 1, 2, 4, and 8 each have exactly one bit set.)
Key concepts
bit_manipulationbitwise_operations
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now