Firibgarlarga uchmang! Telemetrio bunday kanallarni topadi va belgilaydi 👉 Belgini ko‘rmoqchi bo‘lsangiz, obuna bo‘ling

Code With SaiPradeep

Kanalga Telegram’da o‘tish

A space for curious minds to explore software engineering, computer science, programming and technology. Learn. Explore. Understand.

Ko'proq ko'rsatish

Hindiston31 271Texnologiyalar & Aralashmalar10 232...

📈 Telegram kanali Code With SaiPradeep analitikasi

Code With SaiPradeep (@codewithsaipradeep) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 12 327 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 10 232-o'rinni va Hindiston mintaqasida 31 271-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

невідомо sanasidan buyon loyiha tez o‘sib, 12 327 obunachiga ega bo‘ldi.

12 Noyabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -238 ga, so‘nggi 24 soatda esa -8 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.

Tasdiqlash holati: Tasdiqlanmagan
Jalb etish (ER): Auditoriya o‘rtacha 10.45% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining N/A% ini tashkil etuvchi reaksiyalarni to‘playdi.
Post qamrovi: Har bir post o‘rtacha 1 288 marta ko‘riladi; birinchi sutkada odatda 0 ta ko‘rish yig‘iladi.
Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 11 ta reaksiya keladi.
Tematik yo‘nalishlar: Kontent input, string, scanf("%d, array, element kabi asosiy mavzularga jamlangan.

📝 Tavsif va kontent siyosati

Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
“A space for curious minds to explore software engineering, computer science, programming and technology. Learn. Explore. Understand.”

Yuqori yangilanish chastotasi (oxirgi ma’lumot 13 Noyabr, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli bo‘lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Texnologiyalar & Aralashmalar toifasidagi muhim ta’sir nuqtasiga aylantirishini ko‘rsatadi.

12 327

Obunachilar

-824 soatlar

-827 kun

-23830 kun

1 288

Post ko'rishlar

Ma'lumot yo'q24 soatlar

Ma'lumot yo'q48 soatlar

10.45%

Muloqot nisbati

Ma'lumot yo'q

Kuniga postlar

Ads index

Postlar arxiv

12 327

💻 Find Product of All Elements in Array

#include <stdio.h>

int main() {
    int n, i;
    long long product = 1;

    printf("Enter the number of elements in the array: ");
    scanf("%d", &n);

    int arr[n];

    printf("Enter the elements of the array:n");
    for (i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    for (i = 0; i < n; i++) {
        product *= arr[i];
    }

    printf("Product of all elements in the array = %lldn", product);

    return 0;
}

📤 Output:

Input: 5
Input: 1
Input: 2
Input: 3
Input: 4
Input: 5
Output: Product of all elements in the array = 120

12 327

💻 Find Cumulative Sum of Array

#include <stdio.h>

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

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

  int cumulative_sum[n];
  cumulative_sum[0] = arr[0];

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

  printf("Cumulative sum of the array:n");
  for (int i = 0; i < n; i++) {
    printf("%d ", cumulative_sum[i]);
  }
  printf("n");

  return 0;
}

📤 Output:

Input: 5
Input: 1
Input: 2
Input: 3
Input: 4
Input: 5
Output: Enter the size of the array: Enter the elements of the array:
Cumulative sum of the array:
1 3 6 10 15

12 327

💻 Count Positive and Negative Numbers in Array

#include <stdio.h>

int main() {
  int arr[100];
  int n, i, positiveCount = 0, negativeCount = 0;

  printf("Enter the number of elements in the array: ");
  scanf("%d", &n);

  printf("Enter the elements of the array:n");
  for (i = 0; i < n; i++) {
    scanf("%d", &arr[i]);
  }

  for (i = 0; i < n; i++) {
    if (arr[i] > 0) {
      positiveCount++;
    } else if (arr[i] < 0) {
      negativeCount++;
    }
  }

  printf("Positive numbers: %dn", positiveCount);
  printf("Negative numbers: %dn", negativeCount);

  return 0;
}

📤 Output:

Input: 5
Input: 1
Input: -2
Input: 3
Input: -4
Input: 0
Output: Enter the number of elements in the array: Enter the elements of the array:
Positive numbers: 2
Negative numbers: 2

12 327

💻 Count Even and Odd Numbers in Array

#include <stdio.h>

int main() {
    int arr[100];
    int n, i, evenCount = 0, oddCount = 0;

    printf("Enter the number of elements in the array: ");
    scanf("%d", &n);

    printf("Enter the elements of the array:n");
    for (i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    for (i = 0; i < n; i++) {
        if (arr[i] % 2 == 0) {
            evenCount++;
        } else {
            oddCount++;
        }
    }

    printf("Even numbers: %dn", evenCount);
    printf("Odd numbers: %dn", oddCount);

    return 0;
}

📤 Output:

Input: 5
Input: 1
Input: 2
Input: 3
Input: 4
Input: 5
Output: Even numbers: 2
Output: Odd numbers: 3

12 327

💻 Find Second Smallest Element in Array

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

int main() {
    int n, i;

    printf("Enter the number of elements in the array: ");
    scanf("%d", &n);

    int arr[n];

    printf("Enter the elements of the array:n");
    for (i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    int smallest = INT_MAX;
    int secondSmallest = INT_MAX;

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

    if (secondSmallest == INT_MAX) {
        printf("There is no second smallest element.n");
    } else {
        printf("The second smallest element is: %dn", secondSmallest);
    }

    return 0;
}

📤 Output:

Input: 5
Input: 5
Input: 2
Input: 8
Input: 1
Input: 9
Output: The second smallest element is: 2

Input: 4
Input: 1
Input: 1
Input: 1
Input: 1
Output: There is no second smallest element.

Input: 3
Input: 10
Input: 5
Input: 10
Output: The second smallest element is: 10

Input: 2
Input: 7
Input: 3
Output: The second smallest element is: 7

12 327

💻 Find Second Largest Element in Array

#include <stdio.h>

int main() {
    int n, i, largest, secondLargest;

    printf("Enter the number of elements in the array: ");
    scanf("%d", &n);

    int arr[n];

    printf("Enter the elements of the array:n");
    for (i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    if (n < 2) {
        printf("Array should have at least two elements.n");
        return 0;
    }

    largest = arr[0];
    secondLargest = arr[1];

    if (secondLargest > largest) {
        int temp = largest;
        largest = secondLargest;
        secondLargest = temp;
    }

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

    if (largest == secondLargest) {
        printf("There is no second largest element as all elements are the same.n");
    } else {
        printf("The second largest element in the array is: %dn", secondLargest);
    }

    return 0;
}

📤 Output:

Input: 5
Input: 10
Input: 5
Input: 8
Input: 2
Input: 7
Output: The second largest element in the array is: 8

Input: 3
Input: 5
Input: 5
Input: 5
Output: There is no second largest element as all elements are the same.

Input: 1
Output: Enter the number of elements in the array: Array should have at least two elements.

Input: 2
Input: 1
Input: 2
Output: The second largest element in the array is: 1

12 327

💻 Remove Duplicates from Array

#include <stdio.h>

int main() {
    int n;
    printf("Enter the number of elements: ");
    scanf("%d", &n);

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

    int uniqueArr[n];
    int uniqueSize = 0;

    for (int i = 0; i < n; i++) {
        int isDuplicate = 0;
        for (int j = 0; j < uniqueSize; j++) {
            if (arr[i] == uniqueArr[j]) {
                isDuplicate = 1;
                break;
            }
        }
        if (!isDuplicate) {
            uniqueArr[uniqueSize] = arr[i];
            uniqueSize++;
        }
    }

    printf("Array with unique elements:n");
    for (int i = 0; i < uniqueSize; i++) {
        printf("%d ", uniqueArr[i]);
    }
    printf("n");

    return 0;
}

📤 Output:

Input: 5
Input: 1
Input: 2
Input: 2
Input: 3
Input: 4
Output: Enter the number of elements: Enter the elements:
Array with unique elements:
1 2 3 4
Input: 7
Input: 5
Input: 2
Input: 5
Input: 1
Input: 2
Input: 3
Input: 4
Output: Enter the number of elements: Enter the elements:
Array with unique elements:
5 2 1 3 4

12 327

💻 Check if Array is Sorted

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

int main() {
    int n;

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

    int arr[n];

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

    bool isSorted = true;
    for (int i = 0; i < n - 1; i++) {
        if (arr[i] > arr[i + 1]) {
            isSorted = false;
            break;
        }
    }

    if (isSorted) {
        printf("Array is sorted.n");
    } else {
        printf("Array is not sorted.n");
    }

    return 0;
}

📤 Output:

Input: 5
Input: 1 2 3 4 5
Output: Array is sorted.
Input: 5
Input: 5 4 3 2 1
Output: Array is not sorted.
Input: 4
Input: 1 2 4 3
Output: Array is not sorted.
Input: 3
Input: 1 1 1
Output: Array is sorted.
Input: 1
Input: 10
Output: Array is sorted.

12 327

💻 Reverse an Array

#include <stdio.h>

int main() {
    int n, i, temp;

    printf("Enter the number of elements in the array: ");
    scanf("%d", &n);

    int arr[n];

    printf("Enter the elements of the array:n");
    for (i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    // Reversing the array
    for (i = 0; i < n / 2; i++) {
        temp = arr[i];
        arr[i] = arr[n - i - 1];
        arr[n - i - 1] = temp;
    }

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

    return 0;
}

📤 Output:

Input: 5
Input: 1
Input: 2
Input: 3
Input: 4
Input: 5
Output: Enter the number of elements in the array: Enter the elements of the array:
Reversed array: 5 4 3 2 1

Input: 6
Input: 10
Input: 20
Input: 30
Input: 40
Input: 50
Input: 60
Output: Enter the number of elements in the array: Enter the elements of the array:
Reversed array: 60 50 40 30 20 10

12 327

💻 Average of Array Elements

#include <stdio.h>

int main() {
  int n, i;
  float sum = 0.0, average;

  printf("Enter the number of elements: ");
  scanf("%d", &n);

  float arr[n];

  printf("Enter the elements:n");
  for (i = 0; i < n; i++) {
    scanf("%f", &arr[i]);
    sum += arr[i];
  }

  average = sum / n;

  printf("Average = %.2fn", average);

  return 0;
}

📤 Output:

Input: 3
Input: 1.0
Input: 2.0
Input: 3.0
Output: Enter the number of elements: Enter the elements:
Average = 2.00

12 327

💻 Sum of All Elements in Array

#include <stdio.h>

int main() {
    int n, i, sum = 0;

    printf("Enter the number of elements in the array: ");
    scanf("%d", &n);

    int arr[n];

    printf("Enter the elements of the array:n");
    for (i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

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

    printf("Sum of all elements in the array = %dn", sum);

    return 0;
}

📤 Output:

Input: 5
Input: 1
Input: 2
Input: 3
Input: 4
Input: 5
Output: Enter the number of elements in the array: Enter the elements of the array:
Sum of all elements in the array = 15

12 327

💻 Find Smallest Element in an Array

#include <stdio.h>

int main() {
  int arr[5];
  int smallest;
  int i;

  printf("Enter 5 integer elements:n");
  for (i = 0; i < 5; i++) {
    scanf("%d", &arr[i]);
  }

  smallest = arr[0];

  for (i = 1; i < 5; i++) {
    if (arr[i] < smallest) {
      smallest = arr[i];
    }
  }

  printf("Smallest element: %dn", smallest);

  return 0;
}

📤 Output:

Input: 5
Input: 2
Input: 8
Input: 1
Input: 9
Output: Enter 5 integer elements:
Output: Smallest element: 1

12 327

💻 Find Largest Element in an Array

#include <stdio.h>

int main() {
    int n;
    printf("Enter the number of elements in the array: ");
    scanf("%d", &n);

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

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

    printf("The largest element in the array is: %dn", largest);

    return 0;
}

📤 Output:

Input: 5
Input: 12
Input: 5
Input: 28
Input: 3
Input: 19
Output: Enter the number of elements in the array: Enter the elements of the array:
The largest element in the array is: 28

12 327

🔧 Arrays - 1D

12 327

💻 Recursive Function to Find Sum of Natural Numbers

#include <stdio.h>

int sum_natural(int n) {
    if (n == 0) {
        return 0;
    } else {
        return n + sum_natural(n - 1);
    }
}

int main() {
    int num;

    printf("Enter a positive integer: ");
    scanf("%d", &num);

    if (num < 0) {
        printf("Please enter a non-negative integer.n");
    } else {
        int sum = sum_natural(num);
        printf("Sum of natural numbers up to %d = %dn", num, sum);
    }

    return 0;
}

📤 Output:

Input: 5
Output: Enter a positive integer: Sum of natural numbers up to 5 = 15

Input: 0
Output: Enter a positive integer: Sum of natural numbers up to 0 = 0

Input: -3
Output: Enter a positive integer: Please enter a non-negative integer.

12 327

💻 Function with Call by Reference

#include <stdio.h>

void increment(int *n) {
  *n = *n + 1;
}

int main() {
  int num = 10;
  printf("Before increment: %dn", num);
  increment(&num);
  printf("After increment: %dn", num);
  return 0;
}

📤 Output:

Before increment: 10
After increment: 11

12 327

💻 Function with Call by Value

#include <stdio.h>

void modifyValue(int x) {
  x = x + 10;
  printf("Value inside function: %dn", x);
}

int main() {
  int num;

  printf("Enter an integer: ");
  scanf("%d", &num);

  printf("Value before function call: %dn", num);
  modifyValue(num);
  printf("Value after function call: %dn", num);

  return 0;
}

📤 Output:

Input: 5
Output: Enter an integer: Value before function call: 5
Value inside function: 15
Value after function call: 5

12 327

💻 Function to Check Strong Number

#include <stdio.h>

int factorial(int n) {
    int fact = 1;
    for (int i = 1; i <= n; i++) {
        fact *= i;
    }
    return fact;
}

int isStrong(int num) {
    int originalNum = num;
    int sum = 0;
    while (num > 0) {
        int digit = num % 10;
        sum += factorial(digit);
        num /= 10;
    }
    if (sum == originalNum) {
        return 1;
    } else {
        return 0;
    }
}

int main() {
    int number;
    printf("Enter a number: ");
    scanf("%d", &number);

    if (isStrong(number)) {
        printf("%d is a strong number.n", number);
    } else {
        printf("%d is not a strong number.n", number);
    }

    return 0;
}

📤 Output:

Input: 145
Output: 145 is a strong number.

Input: 123
Output: 123 is not a strong number.

Input: 40585
Output: 40585 is a strong number.

12 327

💻 Function to Check Perfect Number

#include <stdio.h>

int isPerfect(int num) {
    int sum = 1;
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0) {
            if (i * i != num)
                sum = sum + i + num / i;
            else
                sum = sum + i;
        }
    }
    if (sum == num && num != 1)
        return 1; // True
    else
        return 0; // False
}

int main() {
    int number;
    printf("Enter a number: ");
    scanf("%d", &number);

    if (isPerfect(number)) {
        printf("%d is a perfect numbern", number);
    } else {
        printf("%d is not a perfect numbern", number);
    }

    return 0;
}

📤 Output:

Input: 6
Output: 6 is a perfect number

Input: 28
Output: 28 is a perfect number

Input: 12
Output: 12 is not a perfect number

Input: 496
Output: 496 is a perfect number

Input: 8128
Output: 8128 is a perfect number

Input: 1
Output: 1 is not a perfect number

Input: 0
Output: 0 is not a perfect number

Input: -1
Output: -1 is not a perfect number

12 327

💻 Function to Convert Binary to Decimal

#include <stdio.h>
#include <math.h>

int binaryToDecimal(long long n) {
    int decimalNumber = 0, i = 0, remainder;
    while (n!=0) {
        remainder = n % 10;
        n /= 10;
        decimalNumber += remainder * pow(2, i);
        ++i;
    }
    return decimalNumber;
}

int main() {
    long long n;
    printf("Enter a binary number: ");
    scanf("%lld", &n);
    printf("Decimal equivalent: %d", binaryToDecimal(n));
    return 0;
}

📤 Output:

Input: 101101
Output: Decimal equivalent: 45
Input: 1111
Output: Decimal equivalent: 15
Input: 0
Output: Decimal equivalent: 0
Input: 10000000
Output: Decimal equivalent: 128
Input: 1
Output: Decimal equivalent: 1