Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 464. Can I Win
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source