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 find the smallest element in an array using bubble sort

Smallest Element in Array - C Program

🔹 Find Smallest Element in Array (C Program)

#include <stdio.h>

void smallest(int a[], int num)
{
    // Sort array in ascending order using Bubble Sort
    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;
            }
        }
    }

    // The smallest element will be at index 0
    printf("Smallest element in the array: %d\n", a[0]);
}

int main()
{
    int num;
    printf("Enter the size of the array:\n");
    scanf("%d", &num);

    if (num < 1)
    {
        printf("Invalid! Need at least 1 number to find the smallest element.\n");
        return 1;
    }

    int a[num];
    printf("Enter %d elements:\n", num);
    for (int i = 0; i < num; i++)
    {
        scanf("%d", &a[i]);
    }

    smallest(a, num);
    return 0;
}

📘 Explanation:

  • Takes input for size and elements of the array.
  • Uses Bubble Sort to sort the array in ascending order.
  • After sorting, the smallest element will be at index 0.
  • Handles invalid input if less than 1 element is entered.

🧪 Sample Output:

Enter the size of the array:
4
Enter 4 elements:
22 7 13 9
Smallest element in the array: 7

🏷️ Keywords:

smallest element in C, bubble sort program, C beginner programs, array minimum, array sort example, basic C logic
Labels:

Comments

Post a Comment

Popular Posts

🌙