<p>In a string composed of <code>&#39;L&#39;</code>, <code>&#39;R&#39;</code>, and <code>&#39;X&#39;</code> characters, like <code>&quot;RXXLRXRXL&quot;</code>, a move consists of either replacing one occurrence of <code>&quot;XL&quot;</code> with <code>&quot;LX&quot;</code>, or replacing one occurrence of <code>&quot;RX&quot;</code> with <code>&quot;XR&quot;</code>. Given the starting string <code>start</code> and the ending string <code>end</code>, return <code>True</code> if and only if there exists a sequence of moves to transform <code>start</code> to <code>end</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> start = &quot;RXXLRXRXL&quot;, end = &quot;XRLXXRRLX&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong> We can transform start to end following these steps:
RXXLRXRXL -&gt;
XRXLRXRXL -&gt;
XRLXRXRXL -&gt;
XRLXXRRXL -&gt;
XRLXXRRLX
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> start = &quot;X&quot;, end = &quot;L&quot;
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= start.length&nbsp;&lt;= 10<sup>4</sup></code></li>
	<li><code>start.length == end.length</code></li>
	<li>Both <code>start</code> and <code>end</code> will only consist of characters in <code>&#39;L&#39;</code>, <code>&#39;R&#39;</code>, and&nbsp;<code>&#39;X&#39;</code>.</li>
</ul>

class Solution:
    def canTransform(self, start: str, end: str) -> bool:
        if Counter(start) != Counter(end):
            return False

        startright = []
        endright = []
        startleft = []
        endleft = []

        for i in range(len(start)):
            if start[i] == "R":
                startright.append(i)
            if start[i] == "L":
                startleft.append(i)
        for i in range(len(end)):
            if end[i] == "R":
                endright.append(i)
            if end[i] == "L":
                endleft.append(i)

        for i in range(len(startright)):
            if endright[i] < startright[i]:
                return False
        for i in range(len(startleft)):
            if endleft[i] > startleft[i]:
                return False

        startorder = ""
        for char in start:
            if char in "LR":
                startorder += char

        endorder = ""
        for char in end:
            if char in "LR":
                endorder += char

        if startorder != endorder:
            return False
        return True
17200