LeetCode 2337: Move Pieces to Obtain a String Solution

Master LeetCode problem 2337 (Move Pieces to Obtain a String), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2337. Move Pieces to Obtain a String

Medium

Two Pointers String

Problem Explanation

Explanation:

To solve this problem, we need to check if it is possible to obtain the target string from the start string by moving the pieces 'L' and 'R' in the start string. We can iterate through the strings and simulate the movements of the pieces to determine if the target string can be achieved.

Iterate through the strings, keeping track of the indices of 'L' and 'R' pieces in both start and target strings.
If at any point the movement of a piece is not possible based on the constraints, return false.
If we reach the end of the strings without any violations, return true.

Time Complexity:

The time complexity of this approach is O(n) where n is the length of the strings.

Space Complexity:

The space complexity of this approach is O(1) as we are using a constant amount of extra space.

Solution Code

class Solution {
    public boolean canTransform(String start, String target) {
        int n = start.length();
        int i = 0, j = 0;

        while (i < n && j < n) {
            while (i < n && start.charAt(i) == 'X') i++;
            while (j < n && target.charAt(j) == 'X') j++;

            if (i < n && j < n) {
                if (start.charAt(i) != target.charAt(j)) return false;
                if (start.charAt(i) == 'L' && i < j) return false;
                if (start.charAt(i) == 'R' && i > j) return false;
            }

            i++;
            j++;
        }

        return true;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2337 (Move Pieces to Obtain a String)?

This page provides optimized solutions for LeetCode problem 2337 (Move Pieces to Obtain a String) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2337 (Move Pieces to Obtain a String)?

The time complexity for LeetCode 2337 (Move Pieces to Obtain a String) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2337 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2337 in Java, C++, or Python.

Back to LeetCode Solutions