You are given a string moves representing a sequence of moves starting at the origin $(0, 0)$ on a Cartesian plane.

Each character in moves specifies a direction:

• 'U': Move $1$ unit up to $(x, y + 1)$

• 'D': Move $1$ unit down to $(x, y - 1)$

• 'L': Move $1$ unit left to $(x - 1, y)$

• 'R': Move $1$ unit right to $(x + 1, y)$

• '_': Can be replaced by any one of the four moves 'U', 'D', 'L', or 'R'

Return the maximum Manhattan distance from the origin $(0, 0)$ to the final position after executing all moves.

Note: The Manhattan distance between two points $(x_1, y_1)$ and $(x_2, y_2)$ is $|x_1 - x_2| + |y_1 - y_2|$.

Constraints:

• $1 \leq$ moves.length $\leq 10^5$

• moves consists only of 'U', 'D', 'L', 'R', and '_'

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.