Leetcode 464. Can I Win
Determine whether the first player can force a win in a turn-based game where players alternately pick unused integers from 1..maxChoosableInteger to add to a running total and the player who reaches or exceeds desiredTotal wins. The core challenge is a minimax/search over subsets of available numbers (state space up to 2^20) under optimal play, typically solved with recursion and memoization.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.