You are given an integer array nums. Two players take turns choosing a number from either end of the array. Each chosen number is added to the choosing player’s score, and the chosen element is removed from the array.

Both players play optimally. Return true if player $1$ can win or tie the game, and false otherwise.

Note: A player wins if their score is greater than or equal to the other player’s score.

Constraints:

• 1 <= nums.length <= 20

• 0 <= nums[i] <= 10^7

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.