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

Linear Search in an Array - C Program

Linear Search in Array - C Program

✅ Linear Search in an Array - C Program

#include <stdio.h>

int main() {
    int size, key, found = 0;

    // Input the size of the array
    printf("Enter the size of the array:\n");
    scanf("%d", &size);

    if (size <= 0) {
        printf("Invalid array size!\n");
        return 1;
    }

    int arr[size];

    // Input array elements
    printf("Enter %d elements:\n", size);
    for (int i = 0; i < size; i++) {
        scanf("%d", &arr[i]);
    }

    // Input the element to search
    printf("Enter the element to search:\n");
    scanf("%d", &key);

    // Search for the element
    for (int i = 0; i < size; i++) {
        if (arr[i] == key) {
            printf("Element %d found at index %d (position %d)\n", key, i, i + 1);
            found = 1;
            break;
        }
    }

    if (!found) {
        printf("Element %d not found in the array.\n", key);
    }

    return 0;
}
  

๐Ÿ“˜ Explanation:

This program demonstrates a simple linear search in an array. It takes the array size and elements from the user, along with the target value to search. It then loops through the array and checks for equality with the given key. If found, it prints the index and position. If the element is not present, it informs the user accordingly. The `break` statement is used to stop at the first occurrence.

๐Ÿงพ Sample Output:

Enter the size of the array:
5
Enter 5 elements:
10 20 30 40 50
Enter the element to search:
30
Element 30 found at index 2 (position 3)
  

๐Ÿ”‘ Keywords:

Array Search in C, Linear Search Program, Find Index of Element, C Array Program, Beginner C Code, Searching in Arrays

๐Ÿ“Œ Hashtags:

#CProgramming #ArraySearch #LinearSearch #BeginnerC #CCodeWithExplanation #DataSearch

Comments

๐ŸŒ™