LeetCode 1662: Check If Two String Arrays are Equivalent Solution

Master LeetCode problem 1662 (Check If Two String Arrays are Equivalent), a easy 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.

1662. Check If Two String Arrays are Equivalent

Easy

Array String

Problem Explanation

Explanation:

To solve this problem, we need to concatenate all strings in each array and compare the resulting strings. If the concatenated strings are the same, the two arrays represent the same string. We can achieve this by iterating through each array, concatenating the strings into two separate strings, and then comparing the two strings.

Algorithm:
1. Initialize two empty strings str1 and str2.
2. Iterate through each string in word1 and concatenate them to str1.
3. Iterate through each string in word2 and concatenate them to str2.
4. Compare str1 and str2. If they are equal, return true; otherwise, return false.
Time Complexity: O(n), where n is the total number of characters in both arrays.
Space Complexity: O(n), where n is the total number of characters in both arrays.

Solution Code

class Solution {
    public boolean arrayStringsAreEqual(String[] word1, String[] word2) {
        StringBuilder sb1 = new StringBuilder();
        StringBuilder sb2 = new StringBuilder();
        
        for (String str : word1) {
            sb1.append(str);
        }
        
        for (String str : word2) {
            sb2.append(str);
        }
        
        return sb1.toString().equals(sb2.toString());
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1662 (Check If Two String Arrays are Equivalent)?

This page provides optimized solutions for LeetCode problem 1662 (Check If Two String Arrays are Equivalent) 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 1662 (Check If Two String Arrays are Equivalent)?

The time complexity for LeetCode 1662 (Check If Two String Arrays are Equivalent) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1662 on DevExCode?

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

Back to LeetCode Solutions