Given three strings text, first, and second, find every word that immediately follows an occurrence of first followed immediately by second.

Return an array containing all such words in the order of their appearance in text.

Constraints:

• $1 \leq$ text.length $\leq 1000$

• text consists of lowercase English letters and spaces.

• All the words in text are separated by a single space.

• $1 \leq$ first.length, second.length $\leq 10$

• first and second consist of lowercase English letters.

• text will not have any leading or trailing spaces.

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.