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

C program to check whether a given number is a power of 2 using bitwise operations

Check Power of 2 in C

⚡ Check If a Number Is a Power of 2

#include<stdio.h>

int power(int num)
{
    if(num > 0 && (num & (num - 1)) == 0)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}

int main()
{
    int num;
    scanf("%d", &num);
    
    if(power(num))
    {
        printf("%d is a power of 2\n", num);
    }
    else
    {
        printf("%d is not a power of 2\n", num);
    }
}

📘 Explanation:

✅ The condition (num & (num - 1)) == 0 is true only if there is only one set bit in num.
✅ This logic efficiently checks whether a number is a power of 2.
✅ It excludes 0 and negative numbers.

🧪 Sample Output:

Input:
8
Output:
8 is a power of 2

🏷️ Keywords:

C program power of 2, bitwise check power of 2, efficient logic, beginner C programming, technical interview questions

Labels:

Comments

Post a Comment

Popular Posts

🌙