Dsa
Bit Manipulation
Medium
Count Set Bits in Subarrays
Given an array of integers, find the total count of set bits in all possible continuous subarrays.
Input format:
The first line contains an integer n (1 <= n <= 100), the count of numbers.
The second line contains n space-separated integers (0 <= value <= 100).
Output format:
Print a single integer, the total count of set bits in all subarrays.
Example:
Input: 3
1 2 3
Output: 8
Key concepts
bit_manipulationsubarrays
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