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

Third Smallest Element in Array using bubble sort C program

Third Smallest Element in Array - C Program

๐Ÿงฎ Find Third Smallest Element in Array (C Program)

#include <stdio.h>

void thirdSmallest(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;
            }
        }
    }

    // Directly print the third element after sorting
    printf("Third smallest element in the array: %d\n", a[2]);
}

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

    if (num < 3)
    {
        printf("Invalid! Need at least 3 numbers to find the third 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]);
    }

    thirdSmallest(a, num);
    return 0;
}
  

๐Ÿ“˜ Explanation:

  • Reads the number of elements and validates a minimum of 3 elements.
  • Uses Bubble Sort to sort the array in ascending order.
  • Prints the 3rd element from the sorted array, which is the third smallest.
  • If fewer than 3 elements are entered, it prints an error message.

๐Ÿงช Sample Output:

Enter the size of the array:
6
Enter 6 elements:
45 21 78 12 89 10
Third smallest element in the array: 21
    

๐Ÿท️ Keywords:

third smallest element in array, C array sorting, bubble sort example, C beginner array program, find nth smallest

Comments

Popular Posts

๐ŸŒ™