Skip to content

Practice Can I Win

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#464
LeetCode Problem

Can I Win

MathDynamic ProgrammingBit ManipulationMemoizationGame TheoryBitmask

Problem Statement

In the "100 game" two players take turns adding, to a running total, any integer from 1 to 10. The player who first causes the running total to reach or exceed 100 wins. What if we change the game so that players cannot re-use integers? For example, two players might take turns drawing from a common pool of numbers from 1 to 15 without replacement until they reach a total >= 100. Given two integers maxChoosableInteger and desiredTotal, return true if the first player to move can force a win, otherwise, return false. Assume both players play optimally.

Source: Can I Win on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
maxChoosableInteger = 10, desiredTotal = 11
Output
false

# Example 2

Input
maxChoosableInteger = 10, desiredTotal = 0
Output
true

# Example 3

Input
maxChoosableInteger = 10, desiredTotal = 1
Output
true

Constraints

1 <= maxChoosableInteger <= 20
0 <= desiredTotal <= 300

Related LeetCode Problems

Practice more problems similar to Can I Win.

29 Divide Two Integers Medium62 Unique Paths Medium2 Add Two Numbers Medium5 Longest Palindromic Substring Medium7 Reverse Integer Medium
← Previous Island PerimeterNext → Count The Repetitions

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free