Tower Breakers

Sort by

recency

|

50 Discussions

|

  • + 1 comment

    How come 5 is evently divises 6 in the example @@!

  • + 0 comments

    My Python Solution:

    return 2 if m==1 or n % 2 ==0 else 1

  • + 0 comments

    My rust solution:

    fn towerBreakers(n: i32, m: i32) -> i32 {
        if m == 1 || n % 2 == 0 { 
            2 
        } else { 
            1 
        }
    }
    
  • + 0 comments

    Poor case! How come every case has m=1 except for the first and the last cases!

  • + 0 comments

    Game sounds like Cups from FRIENDS:

    def towerBreakers(n, m):

    if n % 2 == 0 or m == 1:
        return 2
    else:
        return 1