There is an $n imes n$ grid with coordinates ranging from $(0, 0)$ to $(n - 1, n - 1)$. A robot is placed at the starting position startPos $= [start_{row}, start_{col}]$.

You are given the integer n, the array startPos, and a string s of length $m$ representing movement instructions. The valid directions are:

• 'L': Move left by decreasing the column index by $1$.

• 'R': Move right by increasing the column index by $1$.

• 'U': Move up by decreasing the row index by $1$.

• 'D': Move down by increasing the row index by $1$.

For each starting instruction index i from $0$ to $m - 1$, the robot begins at startPos and executes the instructions in s sequentially starting from index i. The execution stops as soon as a move would take the robot off the grid or all remaining instructions are completed.

Return an array of length $m$ where the $i^{ ext{th}}$ element is the number of instructions the robot can execute starting from index i.

Constraints:

• m $==$ s.length

• $1 \leq$ n, m $\leq 500$

• startPos.length $== 2$

• $0 \leq start_{row}, start_{col} <$ n

• s consists of 'L', 'R', 'U', and 'D'.

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.