Sanalista

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);
        int lineCount = input.nextInt();

        String stringInput;
        int noOfSatisfyingWords = 0;

        for(int i = 0; i < lineCount; i++) {
            stringInput = input.next();
            if(checkWordPairsOfLetters(stringInput)) {
                noOfSatisfyingWords++;
            }
        }

        System.out.println(noOfSatisfyingWords);
    }

    public static boolean checkWordPairsOfLetters(String word) {
        boolean paired = true;
        int[] letters = new int[27];
        for(int i = 0; i < word.length(); i++) {
            //97 = a, 122 = z
            letters[(int)word.charAt(i)-97]++;
        }
        for(int i = 0; i < 27; i++) {
            if(letters[i] % 2 == 1) {
                paired = false;
                break;
            }
        }
        return paired;
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED