Given two string arrays word1 and word2, determine if the two arrays represent the same string.

An array of strings represents a single string formed by concatenating all of its elements in order. Return true if the concatenated strings from word1 and word2 are equal, and false otherwise.

Constraints:

• $1 \leq$ word1.length, word2.length $\leq 10^3$

• $1 \leq$ word1[i].length, word2[i].length $\leq 10^3$

• $1 \leq$ sum(word1[i].length), sum(word2[i].length) $\leq 10^3$

• word1[i] and word2[i] consist of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.