There are $n$ dominoes placed vertically in a line. You are given a string dominoes of length $n$, where each character represents the initial state of a domino:

• 'L' indicates that the domino is pushed to the left.

• 'R' indicates that the domino is pushed to the right.

• '.' indicates that the domino is standing upright and has not been pushed.

At each second, every domino falling to the left pushes the adjacent domino directly to its left, and every domino falling to the right pushes the adjacent domino directly to its right. If an upright domino is pushed from both sides simultaneously, it remains upright due to the balance of forces.

Return a string representing the final state of the dominoes after all movement has ceased.

Constraints:

• $n ==$ dominoes.length

• $1 \leq n \leq 10^5$

• dominoes[i] is either 'L', 'R', or '.'.

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.