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 ...

C Program: Union and Nibble Sum of a Hexadecimal Number

C Program: Union and Nibble Sum

๐Ÿ”ท C Program: Union and Nibble Sum of a Hexadecimal Number

#include <stdio.h>

union byteunion
{
    unsigned int full_word;
    unsigned char bytes[4];
};

int main( )
{
    union byteunion data;
    scanf("%x", &data.full_word);

    int upper_sum = 0, lower_sum = 0;

    printf("\nBytes: ");
    for (int i = 3; i >= 0; i--)
    {
        printf("0x%02X", data.bytes[i]);
        if (i != 0)
            printf(", ");
    }

    for (int i = 0; i < 4; i++)
    {
        int byte = data.bytes[i];
        int upper = byte / 16;
        int lower = byte % 16;
        upper_sum += upper;
        lower_sum += lower;
    }

    printf("\nUpper nibble addition: 0x%02x", upper_sum);
    printf("\nLower nibble addition: 0x%02X\n", lower_sum);
}
  

๐Ÿ“˜ Explanation:

This program demonstrates how to use a union in C to access individual bytes of a 32-bit hexadecimal input.

๐Ÿ”น A union is used to share memory between an unsigned int and an array of 4 bytes.
๐Ÿ”น The user inputs a 32-bit hexadecimal number.
๐Ÿ”น The program prints all 4 bytes from most significant to least significant.
๐Ÿ”น Each byte is split into upper and lower 4-bit nibbles.
๐Ÿ”น It then calculates and displays the sum of upper and lower nibbles separately in hexadecimal format.

๐Ÿ” Sample Output:

Input:
12345678

Output:
Bytes: 0x12, 0x34, 0x56, 0x78
Upper nibble addition: 0x15
Lower nibble addition: 0x14
    

๐Ÿท️ Keywords:

C union example, hexadecimal byte access, nibble sum, bitwise manipulation, memory sharing in C, byte array, 32-bit hex analysis

Comments

Popular Posts

๐ŸŒ™