tag

#brainteasers

2 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1025: Divisor Game

Problem Restatement Alice and Bob play a game. They start with the number n . On each turn, the current player chooses a number x such that: 0 < x < n n % x == 0 Then n is replaced by n - x . The player who cannot make a move loses. Alice always goes first. Both players play optimally. Return true if Alice wins, false if Bob...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1033: Moving Stones Until Consecutive

Problem Restatement Three stones are at positions a , b , c on a number line where a < b < c . In one move, we pick the leftmost or rightmost stone and move it to an open position between the other two stones. We need to return an array of two integers: result[0] : minimum number of moves. result[1] : maximum number of moves. The official constraints state...