Count Non-Set (0) Bits in a 32-bit Integer in c

February 24, 2026

C Program to Solve Two Sum Using Brute Force (With Algorithm & Output)

Introduction The Two Sum problem is a popular coding interview question where we must find two indices of an array whose values add up to a given target. This program demonstrates a simple brute-force solution in C using nested loops and dynamic memory allocation. Problem Statement Given an integer array and a target value, return the indices of the two numbers such that they add up to the target. Each input has exactly one solution, and the same element cannot be used twice. The result should return the indices, not the values. If no solution exists, return NULL. Algorithm / Logic Explanation Start the program. Traverse the array using a loop from index 0 to numsSize - 1 . Inside this loop, use another loop starting from i + 1 to numsSize - 1 . For every pair (i, j) , check if nums[i] + nums[j] == target . If condition becomes true: Allocate memory for 2 integers using malloc() . Store indices i and j . Set returnSize = 2 . Return the result poi...

🧮 Count Non-Set (0) Bits in a 32-bit Integer

#include <stdio.h> int main() { unsigned int num; int count = 0; // Read input from user printf("Enter the number : "); scanf("%u", &num); // Loop through all 32 bits for (int i = 0; i < 32; i++) { if ((num & (1 << i)) == 0) { count++; } } // Output result printf("The count of non set bits is %d\n", count); return 0; }

📘 Explanation:

🔹 The program loops over each bit of a 32-bit unsigned integer using a bitwise AND operation.
🔹 If a bit is 0, it increments the `count` of non-set bits.
🔹 Works for any unsigned integer in the 32-bit range.

🧪 Sample Output:

Enter the number : 10
The count of non set bits is 30

🏷️ Keywords:

C program to count 0 bits, count unset bits, bitwise logic, 32-bit integer, technical interview question, C beginner practice

Search This Blog

1PRINTF

Featured

C Program to Solve Two Sum Using Brute Force (With Algorithm & Output)