Tag Archives: Anagram

Anagram

Posted on by
Reply

#codeifyoucansolve
Sid is obsessed about reading short stories. Being a CS student, he is doing some interesting frequency analysis with the books. He chooses strings S1 and S2 in such a way |len(S1)−len(S2)|≤1.

Your task is to help him find the minimum number of characters of the first string he needs to change to enable him to make it an anagram of the second string.

Note: A word x is anagram of another word y, if we can produce y by rearranging the letters of x.

Input Format

The first line will contain an integer T representing the number of test cases. Each test case will contain a string having length len(S1)+len(S2) which will be concatenation of both the strings described above in the problem.The given string will contain only characters from a to z.

Output Format

An integer corresponding to each test case is printed in a different line i.e., the number of changes required for each test case. Print −1 if it is not possible.

Constraints

1≤T≤100
1≤len(S1)+len(S2)≤104

Sample Input

6
aaabbb
ab
abc
mnop
xyyx
xaxbbbxx
Sample Output

3
1
-1
2
0
1
Explanation
Test Case #01: We have to replace at least three characters from any of the string to make both of strings anagram. Here, a = “aaa” and b = “bbb”. One possible solution is to replace all character ‘a’ in string a with character ‘b’.
Test Case #02: Either replace ‘a’ with ‘b’, which will generate “bb”. Or replace ‘b’ with ‘a’ to generate “aa”. Both of the solution are valid.
Test Case #03: It is not possible for two strings of unequal length to be anagram for each other.
Test Case #04: We have to replace both the characters of any string to make it anagram of other one.
Test Case #05: _S1_ and S2 are already anagram to each other.
Test Case #06: Here S1 = “xaxb” and S2 = “bbxx”. He had to replace ‘a’ from S1 with ‘b’ so that S1 = “xbxb” and we can rearrange its letter to “bbxx” in order to get S2.

Copyright (c) 2015 HackerRank.
All Rights Reserved
Suggest Edits
6610 hackers have submitted code

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int f[26];
int sd[26];
int main() {
    int T,sum,i;
    char s[10000];
    scanf("%d",&T);
    while(T--)
        {
        sum = 0;
        scanf("%s",s);
        for(i=0;i<26;i++)
            {
            f[i]=sd[i]=0;
        }
        if(strlen(s)%2 != 0)
            {
            printf("-1\n");
            continue;
        }
        for(i=0;i<(strlen(s)/2);i++)
            f[(s[i]-97)] +=1;
        for(i=(strlen(s)/2);i<(strlen(s));i++)
            sd[(s[i]-97)] +=1;
        for(i=0;i<26;i++)
            sum += abs(f[i]-sd[i]);
            printf("%d\n",(sum/2));
    }
    return 0;
}

Compile & Run : http://ideone.com/NNGGfp
Follow On Twitter : https://twitter.com/codeifucansolve
Follow On Quora Blog : http://codeifyoucansolve.quora.com/Anagram