LeetCode 2840: Check if Strings Can be Made Equal With Operations II Solution

Master LeetCode problem 2840 (Check if Strings Can be Made Equal With Operations II), 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.

2840. Check if Strings Can be Made Equal With Operations II

Medium

Hash Table String Sorting

Problem Explanation

Explanation

To solve this problem, we need to determine if it is possible to make two strings equal by applying the given operation. The key observation is that for any valid swap operation (i, j), the parity of the character distance (j - i) is preserved in both strings. Therefore, for the strings to be equal, the parity of character distances must also match between the two strings. We can calculate the character distance parity for both strings and check if they are the same.

Algorithm:

Calculate the character distance parity for both strings.
Check if the character distance parities are the same.
If the parities match, return true; otherwise, return false.

Time Complexity:

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

Space Complexity:

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

Solution Code

public boolean canBeMadeEqual(String s1, String s2) {
    if (s1.length() != s2.length()) {
        return false;
    }
    
    int[] parity1 = new int[26];
    int[] parity2 = new int[26];
    
    for (int i = 0; i < s1.length(); i++) {
        int idx1 = s1.charAt(i) - 'a';
        int idx2 = s2.charAt(i) - 'a';
        parity1[idx1]++;
        parity2[idx2]++;
    }
    
    for (int i = 0; i < 26; i++) {
        if (parity1[i] % 2 != parity2[i] % 2) {
            return false;
        }
    }
    
    return true;
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2840 (Check if Strings Can be Made Equal With Operations II)?

This page provides optimized solutions for LeetCode problem 2840 (Check if Strings Can be Made Equal With Operations II) 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 2840 (Check if Strings Can be Made Equal With Operations II)?

The time complexity for LeetCode 2840 (Check if Strings Can be Made Equal With Operations II) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2840 on DevExCode?

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

Back to LeetCode Solutions