Code With SaiPradeep
Open in Telegram
A space for curious minds to explore software engineering, computer science, programming and technology. Learn. Explore. Understand.
Show more📈 Analytical overview of Telegram channel Code With SaiPradeep
Channel Code With SaiPradeep (@codewithsaipradeep) in the English language segment is an active participant. Currently, the community unites 12 331 subscribers, ranking 10 226 in the Technologies & Applications category and 31 277 in the India region.
📊 Audience metrics and dynamics
Since its creation on невідомо, the project has demonstrated rapid growth, gathering an audience of 12 331 subscribers.
According to the latest data from 11 November, 2026, the channel demonstrates stable activity. Although there has been a change in the number of participants by -238 over the last 30 days and by -16 over the last 24 hours, overall reach remains high.
- Verification status: Not verified
- Engagement rate (ER): The average audience engagement rate is 10.07%. 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 1 242 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 11.
- 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:
“A space for curious minds to explore software engineering, computer science, programming and technology.
Learn. Explore. Understand.”
Thanks to the high frequency of updates (latest data received on 12 November, 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.
12 331
Subscribers
-1624 hours
-807 days
-23830 days
Posts Archive
12 331
💻 Dynamic 2D Array Operations
#include <stdio.h>
#include <stdlib.h>
int main() {
int rows, cols, i, j;
int **arr;
printf("Enter number of rows: ");
scanf("%d", &rows);
printf("Enter number of columns: ");
scanf("%d", &cols);
arr = (int **)malloc(rows * sizeof(int *));
if (arr == NULL) {
printf("Memory allocation failedn");
return 1;
}
for (i = 0; i < rows; i++) {
arr[i] = (int *)malloc(cols * sizeof(int));
if (arr[i] == NULL) {
printf("Memory allocation failedn");
for (j = 0; j < i; j++) {
free(arr[j]);
}
free(arr);
return 1;
}
}
printf("Enter elements of the array:n");
for (i = 0; i < rows; i++) {
for (j = 0; j < cols; j++) {
scanf("%d", &arr[i][j]);
}
}
printf("The array is:n");
for (i = 0; i < rows; i++) {
for (j = 0; j < cols; j++) {
printf("%d ", arr[i][j]);
}
printf("n");
}
for (i = 0; i < rows; i++) {
free(arr[i]);
}
free(arr);
return 0;
}
Input: 2 Input: 3 Input: 1 Input: 2 Input: 3 Input: 4 Input: 5 Input: 6 Output: Enter number of rows: Enter number of columns: Enter elements of the array: The array is: 1 2 3 4 5 6
12 331
💻 Dynamic 1D Array Operations
#include <stdio.h>
#include <stdlib.h>
int main() {
int *arr;
int size, i;
printf("Enter the size of the array: ");
scanf("%d", &size);
arr = (int *)malloc(size * sizeof(int));
if (arr == NULL) {
printf("Memory allocation failed!n");
return 1;
}
printf("Enter the elements of the array:n");
for (i = 0; i < size; i++) {
scanf("%d", &arr[i]);
}
printf("The elements of the array are:n");
for (i = 0; i < size; i++) {
printf("%d ", arr[i]);
}
printf("n");
free(arr);
return 0;
}
Input: 5 Input: 10 Input: 20 Input: 30 Input: 40 Input: 50 Output: Enter the size of the array: Enter the elements of the array: The elements of the array are: 10 20 30 40 50
12 331
💻 Find Maximum Element in Array Using Recursion
#include <stdio.h>
int findMaxRecursive(int arr[], int size) {
if (size == 1) {
return arr[0];
} else {
int maxRest = findMaxRecursive(arr, size - 1);
if (arr[size - 1] > maxRest) {
return arr[size - 1];
} else {
return maxRest;
}
}
}
int main() {
int size, i;
printf("Enter the size of the array: ");
scanf("%d", &size);
int arr[size];
printf("Enter the elements of the array:n");
for (i = 0; i < size; i++) {
scanf("%d", &arr[i]);
}
int max = findMaxRecursive(arr, size);
printf("Maximum element in the array is: %dn", max);
return 0;
}
Input: 5 Input: 10 Input: 5 Input: 20 Input: 15 Input: 25 Output: Maximum element in the array is: 25 Input: 3 Input: -5 Input: 0 Input: 5 Output: Maximum element in the array is: 5 Input: 1 Input: 100 Output: Maximum element in the array is: 100
12 331
💻 Tower of Hanoi
#include <stdio.h>
void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod) {
if (n == 1) {
printf("Move disk 1 from rod %c to rod %cn", from_rod, to_rod);
return;
}
towerOfHanoi(n - 1, from_rod, aux_rod, to_rod);
printf("Move disk %d from rod %c to rod %cn", n, from_rod, to_rod);
towerOfHanoi(n - 1, aux_rod, to_rod, from_rod);
}
int main() {
int num_disks;
printf("Enter the number of disks: ");
scanf("%d", &num_disks);
towerOfHanoi(num_disks, 'A', 'C', 'B'); // A, B and C are names of rods
return 0;
}
Input: 3 Output: Enter the number of disks: Move disk 1 from rod A to rod C Move disk 2 from rod A to rod B Move disk 1 from rod C to rod B Move disk 3 from rod A to rod C Move disk 1 from rod B to rod A Move disk 2 from rod B to rod C Move disk 1 from rod A to rod C
12 331
💻 Count Digits Using Recursion
#include <stdio.h>
int countDigits(int n) {
if (n == 0) {
return 0;
} else {
return 1 + countDigits(n / 10);
}
}
int main() {
int num;
printf("Enter an integer: ");
scanf("%d", &num);
int digitCount = countDigits(num);
printf("Number of digits: %dn", digitCount);
return 0;
}
Input: 12345 Output: Enter an integer: Number of digits: 5 Input: 0 Output: Enter an integer: Number of digits: 0 Input: 99 Output: Enter an integer: Number of digits: 2 Input: -123 Output: Enter an integer: Number of digits: 3
12 331
💻 Check Prime Number Using Recursion
#include <stdio.h>
#include <stdbool.h>
bool isPrimeRecursive(int n, int i) {
if (n <= 1)
return false;
if (i == 1)
return true;
if (n % i == 0)
return false;
return isPrimeRecursive(n, i - 1);
}
int main() {
int num;
printf("Enter a positive integer: ");
scanf("%d", &num);
if (isPrimeRecursive(num, num / 2))
printf("%d is a prime number.n", num);
else
printf("%d is not a prime number.n", num);
return 0;
}
Input: 7 Output: 7 is a prime number. Input: 12 Output: 12 is not a prime number. Input: 1 Output: 1 is not a prime number.
12 331
💻 Product of Two Numbers Using Recursion
#include <stdio.h>
int product(int a, int b) {
if (b == 0) {
return 0;
} else if (b > 0) {
return a + product(a, b - 1);
} else {
return -product(a, -b);
}
}
int main() {
int num1, num2, result;
printf("Enter two integers: ");
scanf("%d %d", &num1, &num2);
result = product(num1, num2);
printf("Product of %d and %d is: %dn", num1, num2, result);
return 0;
}
Input: 5 3 Output: Product of 5 and 3 is: 15 Input: 4 -2 Output: Product of 4 and -2 is: -8 Input: -6 2 Output: Product of -6 and 2 is: -12 Input: -3 -4 Output: Product of -3 and -4 is: 12 Input: 7 0 Output: Product of 7 and 0 is: 0
12 331
💻 Sum of Natural Numbers Using Recursion
#include <stdio.h>
int sum(int n) {
if (n == 0) {
return 0;
} else {
return n + sum(n - 1);
}
}
int main() {
int num;
printf("Enter a positive integer: ");
scanf("%d", &num);
if (num < 0) {
printf("Please enter a positive integer.n");
} else {
int result = sum(num);
printf("Sum = %dn", result);
}
return 0;
}
Input: 10 Output: Enter a positive integer: Sum = 55 Input: 5 Output: Enter a positive integer: Sum = 15 Input: -3 Output: Enter a positive integer: Please enter a positive integer.
12 331
💻 Print Numbers from N to 1 Using Recursion
#include <stdio.h>
void printNumbers(int n) {
if (n > 0) {
printf("%d ", n);
printNumbers(n - 1);
}
}
int main() {
int n;
printf("Enter a positive integer: ");
scanf("%d", &n);
printNumbers(n);
printf("n");
return 0;
}
Input: 5 Output: 5 4 3 2 1
12 331
💻 Print Numbers from 1 to N Using Recursion
#include <stdio.h>
void printNumbers(int n, int current) {
if (current <= n) {
printf("%d ", current);
printNumbers(n, current + 1);
}
}
int main() {
int n;
printf("Enter a positive integer N: ");
scanf("%d", &n);
if (n <= 0) {
printf("Please enter a positive integer.n");
} else {
printNumbers(n, 1);
printf("n");
}
return 0;
}
Input: 5 Output: Enter a positive integer N: 1 2 3 4 5 Input: 1 Output: Enter a positive integer N: 1 Input: 0 Output: Enter a positive integer N: Please enter a positive integer. Input: -3 Output: Enter a positive integer N: Please enter a positive integer.
12 331
💻 Decimal to Binary Conversion Using Recursion
#include <stdio.h>
void decimalToBinary(int n) {
if (n > 0) {
decimalToBinary(n / 2);
printf("%d", n % 2);
}
}
int main() {
int decimal;
printf("Enter a decimal number: ");
scanf("%d", &decimal);
printf("Binary equivalent: ");
if (decimal == 0) {
printf("0");
} else {
decimalToBinary(decimal);
}
printf("n");
return 0;
}
Input: 10 Output: Enter a decimal number: Binary equivalent: 1010 Input: 0 Output: Enter a decimal number: Binary equivalent: 0 Input: 25 Output: Enter a decimal number: Binary equivalent: 11001 Input: 127 Output: Enter a decimal number: Binary equivalent: 1111111 Input: 1 Output: Enter a decimal number: Binary equivalent: 1
12 331
💻 LCM Using Recursion
#include <stdio.h>
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return (a * b) / gcd(a, b);
}
int main() {
int num1, num2;
printf("Enter two positive integers: ");
scanf("%d %d", &num1, &num2);
printf("LCM of %d and %d is %dn", num1, num2, lcm(num1, num2));
return 0;
}
Input: 12 18 Output: Enter two positive integers: LCM of 12 and 18 is 36 Input: 25 15 Output: Enter two positive integers: LCM of 25 and 15 is 75 Input: 7 9 Output: Enter two positive integers: LCM of 7 and 9 is 63
12 331
💻 GCD/HCF Using Recursion
#include <stdio.h>
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int num1, num2;
printf("Enter two positive integers: ");
scanf("%d %d", &num1, &num2);
printf("GCD of %d and %d is %dn", num1, num2, gcd(num1, num2));
return 0;
}
Input: 36 60 Output: Enter two positive integers: GCD of 36 and 60 is 12
12 331
💻 Power of a Number Using Recursion
#include <stdio.h>
int power(int base, int exponent) {
if (exponent == 0) {
return 1;
} else if (exponent > 0) {
return base * power(base, exponent - 1);
} else {
return 1 / power(base, -exponent);
}
}
int main() {
int base, exponent, result;
printf("Enter the base number: ");
scanf("%d", &base);
printf("Enter the exponent: ");
scanf("%d", &exponent);
result = power(base, exponent);
printf("%d^%d = %dn", base, exponent, result);
return 0;
}
Input: 2 Input: 3 Output: 2^3 = 8 Input: 5 Input: 0 Output: 5^0 = 1 Input: 2 Input: -2 Output: 2^-2 = 0
12 331
💻 Check Palindrome Using Recursion
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int isPalindrome(char str[], int start, int end) {
if (start >= end) {
return 1;
}
if (str[start] != str[end]) {
return 0;
}
return isPalindrome(str, start + 1, end - 1);
}
int main() {
char str[100];
printf("Enter a string: ");
scanf("%s", str);
int length = strlen(str);
if (isPalindrome(str, 0, length - 1)) {
printf("%s is a palindromen", str);
} else {
printf("%s is not a palindromen", str);
}
return 0;
}
Input: madam Output: madam is a palindrome Input: racecar Output: racecar is a palindrome Input: hello Output: hello is not a palindrome Input: A man, a plan, a canal: Panama Output: A is not a palindrome
12 331
💻 Reverse a String Using Recursion
#include <stdio.h>
#include <string.h>
void reverseString(char *str, int start, int end) {
if (start >= end) {
return;
}
char temp = str[start];
str[start] = str[end];
str[end] = temp;
reverseString(str, start + 1, end - 1);
}
int main() {
char str[100];
printf("Enter a string: ");
scanf("%s", str);
int length = strlen(str);
reverseString(str, 0, length - 1);
printf("Reversed string: %sn", str);
return 0;
}
Input: hello Output: Reversed string: olleh Input: world Output: Reversed string: dlrow Input: abcdef Output: Reversed string: fedcba Input: A Output: Reversed string: A Input: racecar Output: Reversed string: racecar
12 331
💻 Sum of Digits Using Recursion
#include <stdio.h>
int sumOfDigits(int n) {
if (n == 0) {
return 0;
}
return (n % 10) + sumOfDigits(n / 10);
}
int main() {
int num;
printf("Enter a positive integer: ");
scanf("%d", &num);
if (num < 0) {
printf("Please enter a positive integer.n");
return 1;
}
printf("Sum of digits of %d is %dn", num, sumOfDigits(num));
return 0;
}
Input: 12345 Output: Enter a positive integer: Sum of digits of 12345 is 15 Input: 9876 Output: Enter a positive integer: Sum of digits of 9876 is 30 Input: 0 Output: Enter a positive integer: Sum of digits of 0 is 0 Input: -123 Output: Enter a positive integer: Please enter a positive integer.
12 331
💻 Fibonacci Series Using Recursion
#include <stdio.h>
int fibonacci(int n) {
if (n <= 1) {
return n;
}
return fibonacci(n - 1) + fibonacci(n - 2); // Recursive call
}
int main() {
int num, i;
printf("Enter the number of terms: ");
scanf("%d", &num);
printf("Fibonacci Series: ");
for (i = 0; i < num; i++) {
printf("%d ", fibonacci(i));
}
printf("n");
return 0;
}
Input: 10 Output: Enter the number of terms: Fibonacci Series: 0 1 1 2 3 5 8 13 21 34
12 331
💻 Factorial Using Recursion
#include <stdio.h>
int factorial(int n) {
if (n == 0) {
return 1;
} else {
return n * factorial(n - 1); // Recursive call
}
}
int main() {
int num;
printf("Enter a non-negative integer: ");
scanf("%d", &num);
if (num < 0) {
printf("Factorial is not defined for negative numbers.n");
} else {
printf("Factorial of %d = %dn", num, factorial(num));
}
return 0;
}
Input: 5 Output: Enter a non-negative integer: Factorial of 5 = 120 Input: 0 Output: Enter a non-negative integer: Factorial of 0 = 1 Input: -2 Output: Enter a non-negative integer: Factorial is not defined for negative numbers.
