You are given a string moves of length n consisting of the characters 'L', 'R', and '_'. The string represents your movement on a number line starting from the origin $0$.

In each step:

• If the character is 'L', you move $1$ unit to the left.

• If the character is 'R', you move $1$ unit to the right.

• If the character is '_', you may choose to move $1$ unit to either the left or the right.

Return the maximum distance from the origin you can reach after completing all n moves.

Constraints:

• $1 \leq$ moves.length $= `n` \leq 50$

• moves consists only of the characters '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.