There is an $n \times n$ grid numbered from $0$ to $n^2 - 1$, where each cell at row $r$ and column $c$ holds the value $(r \times n) + c$.

A snake starts at cell $(0, 0)$ with a value of $0$. You are given an array of strings commands that describes the movement of the snake at each step:

• "UP": moves one cell up to $(r - 1, c)$

• "DOWN": moves one cell down to $(r + 1, c)$

• "LEFT": moves one cell left to $(r, c - 1)$

• "RIGHT": moves one cell right to $(r, c + 1)$

Return the value of the cell where the snake ends up after executing all the given commands.

Constraints:

• $2 \leq$ n $\leq 10$

• $1 \leq$ commands.length $\leq 100$

• commands consists only of "UP", "RIGHT", "DOWN", and "LEFT".

• The input is generated such that the snake will not move outside of the boundaries.

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.