How to solve the Codewars's Exes and Ohs

Today I try to solve the algorithm problem of codewars.


Check to see if a string has the same amount of ‘x’s and ‘o’s. The method must return a boolean and be case insensitive. The string can contain any char.


  • XO(“ooxx”) -> true

  • XO(“xooxx”) -> false

  • XO(“ooxXm”) -> true : need to change it to lower case.

  • XO(“zpzpzpp”) -> true

  • XO(“zzoo”) -> false


  • str.toLowerCase : returns lowercase string.

  • split : returns array of strings computed by splitting.

  • equals : returns true if the String are equal.

public class XO {
  public static boolean getXO (String str) {
        # Codewars COC 정책으로 인하여 코드 제거
    return o==x;
Written on November 29, 2018