package hackerrank;

import java.util.Scanner;

public class GameOfThrones1 {
    private static String isPalindrome(String str) {
        // TODO:
        return "YES";
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String str = in.next();
        System.out.println(isPalindrome(str));
    }
}

@@ -14,16 +14,64 @@
 rrank;%0A%0A
+import java.util.HashMap;%0Aimport java.util.Map;%0A
 import j
@@ -88,16 +88,16 @@
 canner;%0A
-
 %0Apublic 
@@ -184,16 +184,548 @@
     
-// TODO:
+Map%3CCharacter, Integer%3E counts = new HashMap%3C%3E();%0A        for (int i = 0; i %3C str.length(); i++) %7B%0A            char c = str.charAt(i);%0A            if (!counts.containsKey(c)) %7B%0A                counts.put(c, 1);%0A            %7D else %7B%0A                counts.put(c, counts.get(c) + 1);%0A            %7D%0A        %7D%0A        int odd = 0;%0A        for (Map.Entry%3CCharacter, Integer%3E e : counts.entrySet()) %7B%0A            if (e.getValue() %25 2 != 0) %7B%0A                odd++;%0A            %7D%0A        %7D%0A        if (odd %3E 1) %7B%0A            return %22NO%22;%0A        %7D
 %0A   

Solve Game of Thrones 1