Skip to main content

Featured

C Program to Check Prime Number Using Efficient Logic

  Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design.  Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...
Post a Comment
Read more

Check If Two Numbers Are Anagrams - C Program

Check If Two Numbers Are Anagrams - C Program

✅ C Program to Check if Two Numbers Are Anagrams

#include <stdio.h>

int countDigits(int n, int count[]) {
    while (n > 0) {
        count[n % 10]++;
        n /= 10;
    }
}

int areAnagrams(int num1, int num2) {
    int count1[10] = {0};
    int count2[10] = {0};

    countDigits(num1, count1);
    countDigits(num2, count2);

    for (int i = 0; i < 10; i++) {
        if (count1[i] != count2[i])
            return 0; // Not anagrams
    }
    return 1; // Anagrams
}

int main() {
    int num1, num2;
    printf("Enter two numbers: ");
    scanf("%d %d", &num1, &num2);

    if (areAnagrams(num1, num2))
        printf("Yes, the numbers are anagrams of each other.\n");
    else
        printf("No, the numbers are not anagrams.\n");

    return 0;
}

📘 Explanation:

This C program checks if two numbers are anagrams of each other. An anagram means both numbers contain the same digits in any order. Here's how it works:

  • countDigits() function builds a frequency count array for digits 0–9.
  • Two arrays are created: one for each number's digit frequency.
  • If both frequency arrays match, the numbers are anagrams.
  • Otherwise, they are not.

🧾 Sample Output:

Enter two numbers: 121 211
Yes, the numbers are anagrams of each other.

Enter two numbers: 123 456
No, the numbers are not anagrams.

🔑 Keywords:

Anagram numbers in C, number digit match, frequency count in C, C program for number comparison, logic-based C program, digit counter

📌 Hashtags:

#CProgramming #AnagramNumbers #InterviewLogic #DigitFrequency #BeginnerC #CodeWithExplanation

🔍 Search Description:

This C program checks if two numbers are anagrams by comparing the frequency of digits in both. Efficient and beginner-friendly approach for digit-based problems in C.

Comments

Post a Comment

Popular Posts

🌙