You are given two strings start and result, each composed of the characters 'L', 'R', and 'X'.

A single move consists of performing one of the following operations:

• Replace any occurrence of "XL" with "LX".

• Replace any occurrence of "RX" with "XR".

Return true if it is possible to transform start into result through any number of valid moves, or false otherwise.

Constraints:

• $1 \leq$ start.length $\leq 10^4$

• start.length $==$ result.length

• Both start and result consist only of the characters 'L', 'R', and 'X'.

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.