You are given an integer array tokens and an integer power.

You begin with an initial score of $0$. Your objective is to maximize your total score by playing tokens. Each token in tokens can be played at most once in any order, using one of the following moves:

• Face up: If your current power is at least tokens[i], you can play token $i$, losing tokens[i] power and gaining $1$ score.

• Face down: If your current score is at least $1$, you can play token $i$, gaining tokens[i] power and losing $1$ score.

Return the maximum score you can achieve after playing any number of tokens.

Constraints:

• $0 \le$ tokens.length $\le 1000$

• $0 \le$ tokens[i], power $< 10^4$

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.