Watch 10 video solutions for Swap Adjacent in LR String, a medium level problem involving Two Pointers, String. This walkthrough by Ashish Pratap Singh has 1,002,140 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
In a string composed of 'L', 'R', and 'X' characters, like "RXXLRXRXL", a move consists of either replacing one occurrence of "XL" with "LX", or replacing one occurrence of "RX" with "XR". Given the starting string start and the ending string result, return True if and only if there exists a sequence of moves to transform start to result.
Example 1:
Input: start = "RXXLRXRXL", result = "XRLXXRRLX" Output: true Explanation: We can transform start to result following these steps: RXXLRXRXL -> XRXLRXRXL -> XRLXRXRXL -> XRLXXRRXL -> XRLXXRRLX
Example 2:
Input: start = "X", result = "L" Output: false
Constraints:
1 <= start.length <= 104start.length == result.lengthstart and result will only consist of characters in 'L', 'R', and 'X'.