1662. Check If Two String Arrays are Equivalent(Solution ||Leetcode easy || Java)

Runtime: 1 ms, faster than 95.38% of Java online submissions for Check If Two String Arrays are Equivalent.

Memory Usage: 41.1 MB, less than 82.29% of Java online submissions for Check If Two String Arrays are Equivalent.

Given two string arrays word1 and word2, return true if the two arrays represent the same string, and false otherwise.

A string is represented by an array if the array elements concatenated in order forms the string.

Example 1:

Input: word1 = ["ab", "c"], word2 = ["a", "bc"]
Output: true
Explanation:
word1 represents string "ab" + "c" -> "abc"
word2 represents string "a" + "bc" -> "abc"
The strings are the same, so return true.

Example 2:

Input: word1 = ["a", "cb"], word2 = ["ab", "c"]
Output: false

Example 3:

Input: word1  = ["abc", "d", "defg"], word2 = ["abcddefg"]
Output: true

Constraints:

• 1 <= word1.length, word2.length <= 103
• 1 <= word1[i].length, word2[i].length <= 103
• 1 <= sum(word1[i].length), sum(word2[i].length) <= 103
• word1[i] and word2[i] consist of lowercase letters.

SOLUTION:

class Solution {
    public boolean arrayStringsAreEqual(String[] word1, String[] word2) {
//We are going to use stringbuilder to avoid extra space usage that
//do not have any reference variable
        StringBuilder sb1 = new StringBuilder();
        StringBuilder sb2 = new StringBuilder();
        
//append all the string of array word1
        for(int i = 0; i < word1.length; i++){
            sb1.append(word1[i]);
        }
  
//append all the strings of array word2      
        for(int i = 0; i < word2.length; i++){
            sb2.append(word2[i]);
        }

//compare both and, if they turns out to be equal return true        
        if(sb1.toString().equals(sb2.toString())){
            return true;
        }
        
        return false;
    }
}

Thank you for reading. If you have any queries then, please let me know in the comment section. I will surely be responsive toward it.