Given two strings word1 and word2, merge them by interleaving their characters in alternating order, beginning with the first character of word1. If one string is longer than the other, append the remaining characters of the longer string to the end of the merged result.

Return the resulting merged string.

Constraints:

• $1 \leq$ word1.length, word2.length $\leq 100$

• word1 and word2 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.