Skip to main content

Featured

Solve LeetCode 3 Longest Substring Without Repeating Characters in C++ using the sliding window

Longest Substring Without Repeating Characters in C++ LeetCode 3 · sliding window · last index array Table of Contents Problem Statement Approach Algorithm C++ Program Input Sample Output Output Explanation Dry Run Flow of Execution Time Complexity Space Complexity Applications Key Points Interview Questions Frequently Asked Questions Conclusion Problem Statement 3. Longest Substring Without Repeating Characters Given a string s , find the length of the longest substring that contains no repeating characters. A substring is a continuous part of the string, so "pwke" is a subsequence of "pwwkew" but not a substring. Approach We use a sliding window . The window is the part of the string between start and end , and we always keep it free of repeated characters. An array lastIndex of size 128 remembers the most recent position of every ASCII ...
Post a Comment
Read more
Labels

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

Count Non-Set Bits in C

🧮 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

Labels:

Comments

Post a Comment

Popular Posts

🌙