We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Game Theory
  4. Tower Breakers
  5. Discussions

Tower Breakers

  • emhhacker
     + 0 comments

    My Java solution with o(1) time complexity and o(1) space:

    public static int towerBreakers(int n, int m) {
        if(m == 1 || n % 2 == 0) return 2;
        else return 1;
    }