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 Sort an Array in Ascending Order (Bubble Sort)

🔢 C Program to Sort an Array in Ascending Order (Bubble Sort)

#include<stdio.h>
int main()
{
    int num;
    printf("Enter Size of the array:\n");
    scanf("%d", &num);
    if(num <= 0)
    {
        printf("!Invalid array size:\n");
        return 1;
    }
    int a[num];
    printf("Enter %d elements in an array:\n", num);
    for(int i = 0; i < num; i++)
    {
        scanf("%d", &a[i]);
    }

    printf("Array elements before ascending order:\n");
    for(int i = 0; i < num; i++)
    {
        printf("%d ", a[i]);
    }

    for(int i = 0; i < num - 1; i++)
    {
        for(int j = 0; j < num - i - 1; j++)
        {
            if(a[j] > a[j + 1])
            {
                int temp = a[j];
                a[j] = a[j + 1];
                a[j + 1] = temp;
            }
        }
    }

    printf("\nArray elements after ascending order:\n");
    for(int i = 0; i < num; i++)
    {
        printf("%d ", a[i]);
    }
}

📝 Explanation:

This C program reads an array of integers, displays it before sorting, then sorts it in ascending order using Bubble Sort algorithm, and displays the sorted array.

💡 Sample Output:

Enter Size of the array:
5
Enter 5 elements in an array:
34 12 78 9 50
Array elements before ascending order:
34 12 78 9 50
Array elements after ascending order:
9 12 34 50 78

🔍 Keywords:

Bubble Sort in C, ascending order array C program, sorting integers, C beginner programs, array logic

Labels:

Comments

Post a Comment

Popular Posts

🌙