C Programming Codes

Open in Telegram

C Programming Codes || Quizzes || DSA Learn along with the community Any queries admin - @Pradeep_saii

India32 062 Technologies & Applications9 537...

📈 Analytical overview of Telegram channel C Programming Codes

Channel C Programming Codes (@c_programming_codes) in the English language segment is an active participant. Currently, the community unites 13 422 subscribers, ranking 9 537 in the Technologies & Applications category and 32 062 in the India region.

📊 Audience metrics and dynamics

Since its creation on невідомо, the project has demonstrated rapid growth, gathering an audience of 13 422 subscribers.

According to the latest data from 12 June, 2026, the channel demonstrates stable activity. Although there has been a change in the number of participants by -240 over the last 30 days and by -9 over the last 24 hours, overall reach remains high.

Verification status: Not verified
Engagement rate (ER): The average audience engagement rate is 9.78%. Within the first 24 hours after publication, content typically collects N/A% reactions from the total number of subscribers.
Post reach: On average, each post receives 0 views. Within the first day, a publication typically gains 0 views.
Reactions and interaction: The audience actively supports content: the average number of reactions per post is 0.
Thematic interests: Content is focused on key topics such as input, string, scanf("%d, array, element.

📝 Description and content policy

The author describes the resource as a platform for expressing subjective opinions:
“C Programming Codes || Quizzes || DSA Learn along with the community Any queries admin - @Pradeep_saii”

Thanks to the high frequency of updates (latest data received on 13 June, 2026), the channel maintains relevance and a high level of publication reach. Analytics show that the audience actively interacts with content, making it an important point of influence in the Technologies & Applications category.

13 422

Subscribers

-924 hours

-617 days

-24030 days

1 313

Post views

No data24 hours

No data48 hours

9.78%

Engagement rate

No data

Posts per day

Ads index

beta

Posts Archive

13 422

Input and Print Matrix Elements

#include <stdio.h>

int main() {
  int rows, cols, i, j;
  printf("Enter rows and columns: ");
  scanf("%d %d", &rows, &cols);
  int matrix[rows][cols];

  printf("Enter matrix elements:\n");
  for (i = 0; i < rows; i++) {
    for (j = 0; j < cols; j++) {
      scanf("%d", &matrix[i][j]);
    }
  }

  printf("Matrix elements are:\n");
  for (i = 0; i < rows; i++) {
    for (j = 0; j < cols; j++) {
      printf("%d ", matrix[i][j]);
    }
    printf("\n");
  }
  return 0;
}

13 422

Longest Increasing Subarray

#include <stdio.h>

int main() {
    int arr[] = {1, 3, 2, 4, 5, 6, 3, 8, 9};
    int n = sizeof(arr) / sizeof(arr[0]);
    int maxLength = 1;
    int currentLength = 1;
    int start = 0;
    int bestStart = 0;

    for (int i = 1; i < n; i++) {
        if (arr[i] > arr[i - 1]) {
            currentLength++;
        } else {
            if (currentLength > maxLength) {
                maxLength = currentLength;
                bestStart = start;
            }
            currentLength = 1;
            start = i;
        }
    }

    if (currentLength > maxLength) {
        maxLength = currentLength;
        bestStart = start;
    }

    printf("Longest increasing subarray: ");
    for (int i = bestStart; i < bestStart + maxLength; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");

    return 0;
}

13 422

Maximum Product of Two Elements in Array

#include <stdio.h>

int main() {
    int arr[] = {1, 5, 4, 6, 0};
    int n = sizeof(arr) / sizeof(arr[0]);
    int max1 = arr[0];
    int max2 = arr[1];

    if (max2 > max1) {
        int temp = max1;
        max1 = max2;
        max2 = temp;
    }

    for (int i = 2; i < n; i++) {
        if (arr[i] > max1) {
            max2 = max1;
            max1 = arr[i];
        } else if (arr[i] > max2) {
            max2 = arr[i];
        }
    }

    printf("Maximum product: %d\n", max1 * max2);
    return 0;
}

13 422

Find Missing Number in Range 1 to N using Arrays

#include <stdio.h>

int main() {
    int arr[] = {1, 2, 4, 6, 3, 7, 8};
    int n = sizeof(arr) / sizeof(arr[0]);
    int N = 8;
    int present[N + 1];

    for (int i = 0; i <= N; i++) {
        present[i] = 0;
    }

    for (int i = 0; i < n; i++) {
        present[arr[i]] = 1;
    }

    for (int i = 1; i <= N; i++) {
        if (present[i] == 0) {
            printf("Missing number: %d\n", i);
            break;
        }
    }

    return 0;
}

13 422

Find Leader Elements in an Array

#include <stdio.h>

int main() {
  int arr[] = {16, 17, 4, 3, 5, 2};
  int n = sizeof(arr) / sizeof(arr[0]);
  int max_from_right = arr[n - 1];

  printf("%d ", max_from_right);

  for (int i = n - 2; i >= 0; i--) {
    if (arr[i] > max_from_right) {
      max_from_right = arr[i];
      printf("%d ", max_from_right);
    }
  }
  printf("\n");
  return 0;
}

13 422

Equilibrium Index in an Array

#include <stdio.h>

int main() {
    int arr[] = {-7, 1, 5, 2, -4, 3, 0};
    int n = sizeof(arr) / sizeof(arr[0]);
    int leftSum, rightSum, i, j;

    for (i = 0; i < n; i++) {
        leftSum = 0;
        for (j = 0; j < i; j++) {
            leftSum += arr[j];
        }

        rightSum = 0;
        for (j = i + 1; j < n; j++) {
            rightSum += arr[j];
        }

        if (leftSum == rightSum) {
            printf("Equilibrium index: %d\n", i);
            return 0;
        }
    }

    printf("No equilibrium index found.\n");
    return 0;
}

13 422

Array Element Equality Check (Any Order)

#include <stdio.h>
#include <stdbool.h>

#define MAX_SIZE 100

bool areArraysEqual(int arr1[], int arr2[], int size1, int size2) {
    if (size1 != size2) {
        return false;
    }

    int count[MAX_SIZE] = {0};

    for (int i = 0; i < size1; i++) {
        count[arr1[i]]++;
    }

    for (int i = 0; i < size2; i++) {
        count[arr2[i]]--;
    }

    for (int i = 0; i < MAX_SIZE; i++) {
        if (count[i] != 0) {
            return false;
        }
    }

    return true;
}

int main() {
    int arr1[] = {1, 2, 3, 4, 5};
    int arr2[] = {5, 4, 3, 2, 1};
    int size1 = sizeof(arr1) / sizeof(arr1[0]);
    int size2 = sizeof(arr2) / sizeof(arr2[0]);

    if (areArraysEqual(arr1, arr2, size1, size2)) {
        printf("Arrays are equal.\n");
    } else {
        printf("Arrays are not equal.\n");
    }

    return 0;
}

13 422

Check if Two Arrays are Equal

#include <stdio.h>
#include <stdbool.h>

bool areArraysEqual(int arr1[], int arr2[], int size) {
    for (int i = 0; i < size; i++) {
        if (arr1[i] != arr2[i]) {
            return false;
        }
    }
    return true;
}

int main() {
    int arr1[] = {1, 2, 3, 4, 5};
    int arr2[] = {1, 2, 3, 4, 5};
    int size = sizeof(arr1) / sizeof(arr1[0]);

    if (areArraysEqual(arr1, arr2, size)) {
        printf("Arrays are equal.\n");
    } else {
        printf("Arrays are not equal.\n");
    }

    return 0;
}

13 422

Check if Array is Sorted and Rotated

#include <stdio.h>
#include <stdbool.h>

bool isSortedAndRotated(int arr[], int n) {
    int i, minIndex = 0;
    for (i = 1; i < n; i++)
        if (arr[i] < arr[minIndex])
            minIndex = i;

    for (i = 1; i < n; i++)
        if (arr[(minIndex + i) % n] < arr[(minIndex + i - 1) % n])
            return false;

    return true;
}

int main() {
    int arr[] = {3, 4, 5, 1, 2};
    int n = sizeof(arr) / sizeof(arr[0]);

    if (isSortedAndRotated(arr, n))
        printf("Array is sorted and rotated\n");
    else
        printf("Array is not sorted and rotated\n");

    return 0;
}

13 422

Shift Negative Elements in Array

#include <stdio.h>

void shiftNegative(int arr[], int n) {
 int j = 0;
 for (int i = 0; i < n; i++) {
 if (arr[i] < 0) {
 if (i != j) {
 int temp = arr[i];
 arr[i] = arr[j];
 arr[j] = temp;
 }
 j++;
 }
 }
}

int main() {
 int arr[] = {1, -2, 3, -4, 5, -6};
 int n = sizeof(arr) / sizeof(arr[0]);

 shiftNegative(arr, n);

 for (int i = 0; i < n; i++) {
 printf("%d ", arr[i]);
 }
 printf("\n");

 return 0;
}

13 422

Move Zeros to the End of an Array

#include <stdio.h>

void moveZerosToEnd(int arr[], int n) {
    int count = 0;
    for (int i = 0; i < n; i++) {
        if (arr[i] != 0) {
            arr[count++] = arr[i];
        }
    }
    while (count < n) {
        arr[count++] = 0;
    }
}

int main() {
    int arr[] = {0, 1, 0, 3, 12};
    int n = sizeof(arr) / sizeof(arr[0]);
    moveZerosToEnd(arr, n);
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

13 422

Left Rotate Array by K Positions

#include <stdio.h>

void leftRotate(int arr[], int n, int k) {
 int temp[k];
 for (int i = 0; i < k; i++) {
 temp[i] = arr[i];
 }
 for (int i = k; i < n; i++) {
 arr[i - k] = arr[i];
 }
 for (int i = 0; i < k; i++) {
 arr[n - k + i] = temp[i];
 }
}

int main() {
 int arr[] = {1, 2, 3, 4, 5, 6, 7};
 int n = sizeof(arr) / sizeof(arr[0]);
 int k = 2;
 leftRotate(arr, n, k);
 for (int i = 0; i < n; i++) {
 printf("%d ", arr[i]);
 }
 printf("\n");
 return 0;
}

13 422

https://t.me/computer_science_fundamentals_cs

13 422

Right Rotate Array by 1 Position

#include <stdio.h>

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int n = sizeof(arr) / sizeof(arr[0]);
    int temp = arr[n - 1];

    for (int i = n - 1; i > 0; i--) {
        arr[i] = arr[i - 1];
    }

    arr[0] = temp;

    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");

    return 0;
}

13 422

Left Rotate Array by 1 Position

#include <stdio.h>

void leftRotate(int arr[], int n) {
 int temp = arr[0];
 for (int i = 0; i < n - 1; i++) {
 arr[i] = arr[i+1];
 }
 arr[n-1] = temp;
}

int main() {
 int arr[] = {1, 2, 3, 4, 5};
 int n = sizeof(arr) / sizeof(arr[0]);

 leftRotate(arr, n);

 for (int i = 0; i < n; i++) {
 printf("%d ", arr[i]);
 }
 printf("\n");
 return 0;
}

13 422

c_arrays.pdf8.36 KB

13 422

Find the First Non-Repeating Element in an Array

#include <stdio.h>

int main() {
    int arr[] = {1, 2, 3, 4, 1, 2, 5};
    int size = sizeof(arr) / sizeof(arr[0]);
    int i, j, found = 0;

    for (i = 0; i < size; i++) {
        int count = 0;
        for (j = 0; j < size; j++) {
            if (arr[i] == arr[j]) {
                count++;
            }
        }
        if (count == 1) {
            printf("First non-repeating element: %d\n", arr[i]);
            found = 1;
            break;
        }
    }

    if (!found) {
        printf("No non-repeating element found.\n");
    }

    return 0;
}

13 422

First Repeating Element in an Array

#include <stdio.h>

int main() {
    int arr[] = {10, 5, 3, 4, 3, 5, 6};
    int size = sizeof(arr) / sizeof(arr[0]);
    int i, j;

    for (i = 0; i < size; i++) {
        for (j = i + 1; j < size; j++) {
            if (arr[i] == arr[j]) {
                printf("First repeating element: %d\n", arr[i]);
                return 0;
            }
        }
    }

    printf("No repeating element found.\n");
    return 0;
}

13 422

Count Frequency of Each Element in an Array

#include <stdio.h>

int main() {
    int arr[] = {1, 2, 3, 1, 2, 4, 1, 5};
    int size = sizeof(arr) / sizeof(arr[0]);
    int freq[100] = {0}; 

    for (int i = 0; i < size; i++) {
        freq[arr[i]]++;
    }

    for (int i = 0; i < 100; i++) {
        if (freq[i] > 0) {
            printf("Element %d: %d\n", i, freq[i]);
        }
    }

    return 0;
}

13 422

Second Largest and Second Smallest Element in an Array

#include <stdio.h>
#include <limits.h>

int main() {
    int arr[] = {12, 35, 1, 10, 34, 1};
    int n = sizeof(arr) / sizeof(arr[0]);

    int largest = INT_MIN, secondLargest = INT_MIN;
    int smallest = INT_MAX, secondSmallest = INT_MAX;

    for (int i = 0; i < n; i++) {
        if (arr[i] > largest) {
            secondLargest = largest;
            largest = arr[i];
        } else if (arr[i] > secondLargest && arr[i] != largest) {
            secondLargest = arr[i];
        }

        if (arr[i] < smallest) {
            secondSmallest = smallest;
            smallest = arr[i];
        } else if (arr[i] < secondSmallest && arr[i] != smallest) {
            secondSmallest = arr[i];
        }
    }

    printf("Second Largest: %d\n", secondLargest);
    printf("Second Smallest: %d\n", secondSmallest);

    return 0;
}