accfgilmmnrsvwxxyyyz
bbdeeghhijjklmmmooppqrrstuvwwx

fczcanyyy
gilmmrsvwxx
28 = 9 + 30 - 11


fcrxzwscanmligyxyvym whmgpmeoke
jxwtrhvujlmrpdoqbisb

22 != 14 + 4 + 8 = 26

fcrxzwsca nmligyxyvym
jxwtrhvuj lmrpdoqbisb

21

fcrxzwsca
jxwtrhvuj

12





https://www.hackerrank.com/challenges/ctci-making-anagrams/

Would it be possible to request that the 'Strings: Making Anagrams' problem (under 'Practice Interview'->'Preparation Kit'->'String Manipulation'->'Strings: Making Anagrams') be reviewed to confirm whether the solution key (for Java 7 implementations) is correctly assessing submissions?

At present it is possible to create a submission which fails Sample Test case 1 (with a total of '28' instead of '30')... but which passes the other two test cases & which appears otherwise corect/consistent (i.e. yields an algorithm consistent with those posted by other students to the 'Discussions' tab for the problem... and with results that are easily verified via scratch paper).



int numSwapsA = 0;
int m = a.length();
int n = b.length();
String tempString = "";

    if (m > n) {
        String swapString = a;
        a = b;
        b = swapString;
    }

    for (int i = 0; i < a.length(); i++) {
        if (!(b.contains(a.substring(i, i+1)))) {
            numSwapsA++;
        }
        else {
            tempString = tempString + b.substring(i,i+1);
        }
    }

    return numSwapsA + (b.length() - tempString.length());