You are given two strings sentence1 and sentence2, each representing a sentence composed of words separated by single spaces.

Two sentences are considered similar if you can insert an arbitrary sequence of words (which may be empty) into one of the sentences such that the resulting sentence becomes identical to the other sentence. The inserted words must be separated from the surrounding words by spaces.

Return true if sentence1 and sentence2 are similar, or false otherwise.

Constraints:

• $1 \leq$ sentence1.length, sentence2.length $\leq 100$

• sentence1 and sentence2 consist of lowercase and uppercase English letters and spaces.

• The words in sentence1 and sentence2 are separated by a single space.

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.