Dsa
Bit Manipulation
Easy
Bit Count Reversal
Given an integer N, you need to find the binary representation of N, count the number of '1's and '0's in this representation, then create a new integer by reversing the bits of the original number and printing its decimal value. The output should be space-separated: <count_of_1s> <count_of_0s> <reversed_integer>.
Example:
Input:
6
Output:
2 1 3
Key concepts
bit_manipulationcounting
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