You are given an integer array nums representing the points available in a series of games. Two players, Player $1$ and Player $2$, take part in the games.

Initially, Player $1$ is the active player, and both players have a score of $0$.

The games are played sequentially from index $0$ to nums.length $- 1$. For each game $i$:

• If nums[i] is odd, the active player switches to the other player.

• If the game is every $6^{ ext{th}}$ game (that is, $(i + 1)$ is divisible by $6$), the active player switches to the other player.

• The currently active player adds nums[i] points to their score.

Return the final score difference, defined as the score of Player $1$ minus the score of Player $2$.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $1 \leq$ nums[i] $\leq 1000$

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.