uz
Feedback
C Programming Language || Hands On Coding

C Programming Language || Hands On Coding

Kanalga Telegram’da o‘tish

Hands-on C programming language challenges for beginners. Learn building logic by solving programs. Owner: @Pradeep_saii

Ko'proq ko'rsatish

📈 Telegram kanali C Programming Language || Hands On Coding analitikasi

C Programming Language || Hands On Coding (@c_programming_language_coding) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 12 821 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 9 572-o'rinni va Hindiston mintaqasida 31 202-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

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

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

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya o‘rtacha 6.87% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 2.42% ini tashkil etuvchi reaksiyalarni to‘playdi.
  • Post qamrovi: Har bir post o‘rtacha 881 marta ko‘riladi; birinchi sutkada odatda 310 ta ko‘rish yig‘iladi.
  • Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 2 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:
Hands-on C programming language challenges for beginners. Learn building logic by solving programs. Owner: @Pradeep_saii

Yuqori yangilanish chastotasi (oxirgi ma’lumot 29 Avgust, 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 821
Obunachilar
-124 soatlar
-297 kunlar
-21330 kunlar
Postlar arxiv
📚 1. Absolute Fundamentals: Setting Up & Basic Interaction

🚀 Welcome to the C Programming Programs Channel! Welcome to the C Programming Programs Channel, your structured path to mastering C and building rock-solid problem-solving skills. We provide a simple, powerful learning plan: over 500 practical programs that guide you from foundational syntax to advanced data structures and algorithms. For the best experience, we recommend using a PC. Note: The problems sent in the channel are carefully selected to challenge your skills and prepare you for real-world scenarios. Stay Updated & Share Join the channel to get access to all the problems: https://t.me/c_programming_language_programss Share and support your fellow coders! Happy Coding! 🎉

Count Words in a Sentence
#include <stdio.h>
#include <string.h>

int main() {
 char str[100];
 int count = 0, i;

 printf("Enter a sentence: ");
 fgets(str, sizeof(str), stdin);

 for (i = 0; str[i] != '\0'; i++) {
 if (str[i] == ' ') {
 count++;
 }
 }
 if (strlen(str) > 1) {
 count++;
 }

 printf("Number of words: %d\n", count);
 return 0;
}

Pangram Checker
#include <stdio.h>
#include <string.h>
#include <ctype.h>

int isPangram(const char *str) {
 int alphabet[26] = {0};
 int index;
 int i;
 for (i = 0; str[i] != '\0'; i++) {
 if (isalpha(str[i])) {
  index = tolower(str[i]) - 'a';
  alphabet[index] = 1;
 }
 }
 for (i = 0; i < 26; i++) {
 if (alphabet[i] == 0) {
  return 0;
 }
 }
 return 1;
}

int main() {
 char str[100];
 fgets(str, sizeof(str), stdin);
 str[strcspn(str, "\n")] = 0;
 if (isPangram(str)) {
 printf("Pangram\n");
 } else {
 printf("Not a Pangram\n");
 }
 return 0;
}

🔥 Solve LeetCode problems consistently in a structured path. First on telegram, best for cracking interviews and building problem solving skills. 👉https://t.me/+9BYfwzAg1dQzODQ1

Capitalize First Letter of Words in a Sentence
#include <stdio.h>
#include <string.h>
#include <ctype.h>

void capitalize(char str[]) {
    int i = 0;
    if (str[i] != '\0') {
        str[i] = toupper(str[i]);
        i++;
    }
    while (str[i] != '\0') {
        if (str[i-1] == ' ') {
            str[i] = toupper(str[i]);
        }
        i++;
    }
}

int main() {
    char sentence[100];
    printf("Enter a sentence: ");
    fgets(sentence, sizeof(sentence), stdin);
    sentence[strcspn(sentence, "\n")] = 0;
    capitalize(sentence);
    printf("Capitalized sentence: %s\n", sentence);
    return 0;
}

Longest Word in a Sentence
#include <stdio.h>
#include <string.h>

int main() {
  char sentence[100];
  char word[50];
  char longest[50] = "";
  int i, j, len, maxLen = 0;

  printf("Enter a sentence: ");
  fgets(sentence, sizeof(sentence), stdin);
  sentence[strcspn(sentence, "\n")] = 0;

  len = strlen(sentence);
  j = 0;
  for (i = 0; i <= len; i++) {
    if (sentence[i] == ' ' || sentence[i] == '\0') {
      word[j] = '\0';
      if (strlen(word) > maxLen) {
        maxLen = strlen(word);
        strcpy(longest, word);
      }
      j = 0;
    } else {
      word[j++] = sentence[i];
    }
  }

  printf("Longest word: %s\n", longest);
  return 0;
}

Remove Repeated Characters from a String
#include <stdio.h>
#include <string.h>

int main() {
 char str[100], result[100];
 int i, j, k = 0, len;
 int found;

 printf("Enter a string: ");
 fgets(str, sizeof(str), stdin);
 str[strcspn(str, "\n")] = 0;

 len = strlen(str);

 for (i = 0; i < len; i++) {
 found = 0;
 for (j = 0; j < k; j++) {
 if (str[i] == result[j]) {
 found = 1;
 break;
 }
 }
 if (!found) {
 result[k++] = str[i];
 }
 }
 result[k] = '\0';

 printf("String with unique characters: %s\n", result);
 return 0;
}

String Contains Only Digits
#include <stdio.h>
#include <string.h>
#include <ctype.h>

int main() {
  char str[100];
  int i, len, flag = 1;

  scanf("%s", str);
  len = strlen(str);

  for (i = 0; i < len; i++) {
    if (!isdigit(str[i])) {
      flag = 0;
      break;
    }
  }

  if (flag == 1) {
    printf("Yes");
  } else {
    printf("No");
  }
  return 0;
}

Find Most Frequent Character in a String
#include <stdio.h>
#include <string.h>

int main() {
 char str[100];
 int freq[256] = {0};
 int i, max = 0, ascii;

 printf("Enter a string: ");
 fgets(str, sizeof(str), stdin);
 str[strcspn(str, "\n")] = 0;

 for (i = 0; str[i] != '\0'; i++) {
 ascii = (int)str[i];
 freq[ascii]++;
 }

 for (i = 0; i < 256; i++) {
 if (freq[i] > freq[max]) {
 max = i;
 }
 }

 printf("Most frequent character: %c\n", (char)max);
 printf("Frequency: %d\n", freq[max]);

 return 0;
}

🔥Solve LeetCode Problems Daily 👉https://t.me/+9BYfwzAg1dQzODQ1

Character Frequency in String
#include <stdio.h>
#include <string.h>

int main() {
 char str[100];
 int freq[256] = {0};
 int i;

 printf("Enter a string: ");
 fgets(str, sizeof(str), stdin);
 str[strcspn(str, "\n")] = 0;

 for (i = 0; str[i] != '\0'; i++) {
 freq[str[i]]++;
 }

 printf("Character frequencies:\n");
 for (i = 0; i < 256; i++) {
 if (freq[i] != 0) {
 printf("'%c': %d\n", i, freq[i]);
 }
 }

 return 0;
}

String Rotation Check
#include <stdio.h>
#include <string.h>
#include <stdbool.h>

bool areRotations(char *str1, char *str2) {
  int n = strlen(str1);
  int m = strlen(str2);
  if (n != m) return false;
  char temp[2 * n + 1];
  strcpy(temp, str1);
  strcat(temp, str1);
  if (strstr(temp, str2) != NULL) return true;
  return false;
}

int main() {
  char str1[] = "ABCD";
  char str2[] = "CDAB";
  if (areRotations(str1, str2))
    printf("Strings are rotations of each other");
  else
    printf("Strings are not rotations of each other");
  return 0;
}

First Non-Repeating Character in a String
#include <stdio.h>
#include <string.h>

char findFirstNonRepeating(const char *str) {
 int counts[256] = {0};
 int len = strlen(str);
 for (int i = 0; i < len; i++) {
 counts[(unsigned char)str[i]]++;
 }
 for (int i = 0; i < len; i++) {
 if (counts[(unsigned char)str[i]] == 1) {
 return str[i];
 }
 }
 return '\0';
}

int main() {
 char str[] = "programming";
 char result = findFirstNonRepeating(str);
 if (result != '\0') {
 printf("First non-repeating char: %c\n", result);
 } else {
 printf("No non-repeating character found.\n");
 }
 return 0;
}

Anagram String Checker
#include <stdio.h>
#include <string.h>
#include <stdbool.h>

bool areAnagrams(char str1[], char str2[]) {
    int n1 = strlen(str1);
    int n2 = strlen(str2);

    if (n1 != n2)
        return false;

    int count[256] = {0};
    for (int i = 0; str1[i] && str2[i]; i++) {
        count[str1[i]]++;
        count[str2[i]]--;
    }

    for (int i = 0; i < 256; i++)
        if (count[i])
            return false;

    return true;
}

int main() {
    char str1[100], str2[100];
    printf("Enter first string: ");
    scanf("%s", str1);
    printf("Enter second string: ");
    scanf("%s", str2);

    if (areAnagrams(str1, str2))
        printf("\"%s\" and \"%s\" are anagrams\n", str1, str2);
    else
        printf("\"%s\" and \"%s\" are not anagrams\n", str1, str2);

    return 0;
}

Find Duplicate Characters in a String
#include <stdio.h>
#include <string.h>

int main() {
 char str[100];
 int i, j, len;

 printf("Enter a string: ");
 fgets(str, sizeof(str), stdin);
 str[strcspn(str, "\n")] = 0;

 len = strlen(str);

 printf("Duplicate characters are: ");
 for (i = 0; i < len; i++) {
 for (j = i + 1; j < len; j++) {
 if (str[i] == str[j]) {
 printf("%c ", str[i]);
 break;
 }
 }
 }
 printf("\n");

 return 0;
}

Palindrome String Check (No strrev)
#include <stdio.h>
#include <string.h>

int main() {
 char str[100];
 int i, len, flag = 1;

 printf("Enter a string: ");
 scanf("%s", str);

 len = strlen(str);

 for (i = 0; i < len/2; i++) {
 if (str[i] != str[len-i-1]) {
 flag = 0;
 break;
 }
 }

 if (flag) {
 printf("%s is a palindrome", str);
 } else {
 printf("%s is not a palindrome", str);
 }
 return 0;
}

Reverse a String
#include <stdio.h>
#include <string.h>

int main() {
 char str[100];
 int i, len;
 char temp;

 printf("Enter a string: ");
 scanf("%s", str);

 len = strlen(str);

 for (i = 0; i < len/2; i++) {
 temp = str[i];
 str[i] = str[len - i - 1];
 str[len - i - 1] = temp;
 }

 printf("Reversed string: %s\n", str);
 return 0;
}