Anagram

See the original problem on HackerRank.

Solutions

Possible C++ Solution:

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include <set>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() 
{
    int T;
    cin >> T;
    string s;
    while (T--)
    {
        cin >> s;
        if (s.size() % 2)
        {
            cout << -1 << endl;
            continue;
        }    
        multiset<char> inters;
        const auto splitIt = begin(s)+(s.size()/2);
        sort(begin(s), splitIt);
        sort(splitIt, end(s));
        set_intersection(begin(s), splitIt, splitIt, end(s), inserter(inters, end(inters)));
        cout << (s.size()/2-inters.size()) << endl;
    }    
}
We've worked on this challenge in these gyms: modena 
comments powered by Disqus