You are given two integers, maxChoosableInteger and desiredTotal.

Two players take turns choosing an unused integer from $1$ through maxChoosableInteger. Each chosen integer is added to a running total. The player whose choice makes the running total greater than or equal to desiredTotal wins.

Both players play optimally. Return true if the first player can force a win; otherwise, return false.

Implement canIWin(maxChoosableInteger, desiredTotal). The parameter maxChoosableInteger is an integer, desiredTotal is an integer, and the method returns a boolean.

Constraints:

• $1 \leq$ maxChoosableInteger $\leq 20$

• $0 \leq$ desiredTotal $\leq 300`

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.