Given two strings, determine whether they are anagrams of each other. Write clean and runnable Java code covering all possible test cases.

Question

Accepted Answer

A function to determine if two strings are anagrams by comparing character counts.

Anagrams are words formed by rearranging the letters of another, e.g., 'listen' and 'silent'.
Convert both strings to lowercase to ensure case insensitivity.
Remove any non-alphabetic characters if necessary.
Count the frequency of each character in both strings and compare the counts.
If the counts match, the strings are anagrams; otherwise, they are not.

Accepted Answer

#include 
 
 int main()
 {
  //Initializing variables.
  char str[100];
  int i;
  int freq[256] = {0};
  
  //Accepting inputs.
  printf("Enter the string: ");
  gets(str);
  
  //Calculating frequency of each character.
  for(i = 0; str[i] != '\0'; i++)
  {
  freq[str[i]]++;
  }

printf("The non repeating characters are: ");
  for(i = 0; i < 256; i++)
  {
  if(freq[i] == 1)//Finding uniques charcters and printing them.
  {
 printf(" %c ", i);
  }
  }
  return 0;
 }

Asked in Practo and 8 others

Given two strings, determine whether they are anagrams of each other. Write clean and runnable Java code covering all possible test cases.

Interview Questions from Popular Companies