Assignment 6 Question 1 (probably a difficult question)

-
// C program to check if two strings
// are anagrams of each other
#include <stdio.h>
#define NO_OF_CHARS 256
 
/* function to check whether two strings are anagram of 
   each other */
int areAnagram(char* str1, char* str2)
{
    // Create 2 count arrays and initialize all values as 0
    int count1[NO_OF_CHARS] = { 0 };
    int count2[NO_OF_CHARS] = { 0 };
    int i;
 
    // For each character in input strings, increment count in
    // the corresponding count array
    for (i = 0; str1[i] && str2[i]; i++) {
        count1[str1[i]]++;
        count2[str2[i]]++;
    }
 
    // If both strings are of different length. Removing this
    // condition will make the program fail for strings like
    // "aaca" and "aca"
    if (str1[i] || str2[i])
        return 0;
 
    // Compare count arrays
    for (i = 0; i < NO_OF_CHARS; i++)
        if (count1[i] != count2[i])
            return 0;
 
    return 1;
}
 
/* Driver program to test to print printDups*/
int main()
{
    char str1[100];
    char str2[100];
scanf("%s", &*str1);
scanf("%s", &*str2);
    int i=0,count=0;
    if (areAnagram(str1, str2))
        {
for(i=0;;i++)
{
if(str1[i]==str2[i])
{
count++;
}
if(str1[i]=='\0')
{
break;
}
}
count--;
printf("%d", count);
}
    else
        printf("-1");
 
    return 0;
} 

Comments

Post a Comment

Popular posts from this blog

Assignment 8 Question 1

-
#include <stdio.h> #include <stdlib.h> struct DoublyLinkedList{ int data; struct DoublyLinkedList *prev; struct DoublyLinkedList *next; }; void removeNode ( struct DoublyLinkedList **headptr, struct DoublyLinkedList **tailptr, struct DoublyLinkedList *ptr) { if ( ptr == *headptr ){ *headptr = ptr->next; (*headptr)->prev = NULL; }else{ if ( ptr == *tailptr ) { *tailptr = ptr->prev; (*tailptr)->next=NULL; }else{ ptr->prev->next = ptr->next; ptr->next->prev = ptr->prev; } } free ( ptr ); ptr = NULL; return; } void removeData ( struct DoublyLinkedList **headptr, struct DoublyLinkedList **tailptr, int n) { struct DoublyLinkedList *curr; curr = *headptr; while ( curr != NULL && curr->data != n ){ curr = curr->next; } if ( curr != NULL ){ removeNode(headptr, tailptr, curr); } return; } struct DoublyLinkedList *createNode(int n) {
Read more

Assignment 7 Question 2

-
#include <stdio.h> #include <stdlib.h> struct node {     int data;     struct node *next; }; typedef struct node NODE; int main() {     NODE *head=NULL;     NODE *tail=NULL;     int a,n;     scanf("%d",&a);     while(a!=-1)     {         NODE *s;         s=(NODE *)malloc(sizeof(NODE));         s->data=a;         s->next=NULL;         if(head==NULL)         {              head=s;              tail=s;         }         else         {             tail->next=s;             tail=s;         }         scanf("%d",&a);     }     scanf("%d",&n);     struct node *temp=head;     int count=0;     while(temp!=NULL)     {         count++;         temp=temp->next;     }     int l=count-n;     if(l<0)     {         printf("-1");     }     else     {         while(l!=0)         {             head=head->next;             l--;         }          temp=head;  
Read more

Assignment 6 Question 2

-
#include <stdio.h> #define MAX 100 int main() { char str1[MAX]; scanf("%s", &*str1); int i=0; int count1=0; int high=1; for(i=0;i<MAX;i++)   {    if(str1[i]==str1[i+1])    {     count1++;    }else{     if(count1>high)     {    high=count1; }     count1=1;        }    if(str1[i]=='\0')    {     break;    }   }     printf("%d", high); return 0; }
Read more