Blogs Hub

by Sumit Chourasia | Nov 24, 2020 | Category :coding | Tags : algorithm data-structure easy leetcode string

Check If Two String Arrays are Equivalent - String - Easy - LeetCode

Check If Two String Arrays are Equivalent - String - Easy - LeetCode

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.

 

public class Solution {
    public bool ArrayStringsAreEqual(string[] word1, string[] word2) {
        var sb1 = new StringBuilder();
        for(int i=0;i<word1.Length;i++){
            sb1.Append(word1[i]);
        }
        
        var sb2 = new StringBuilder();
        for(int i=0;i<word2.Length;i++){
            sb2.Append(word2[i]);
        }
        
        return sb1.ToString()==sb2.ToString();
    }
}

Time Complexity: O(n)

Space Complexity: O(n)