You are given a string text and a string pattern of length $2$, both consisting of lowercase English letters.

You can insert either pattern[0] or pattern[1] at any index in text exactly once. The character may be inserted at the beginning, at the end, or between any existing characters of text.

Return the maximum number of times pattern can appear as a subsequence in the modified string.

A subsequence is a string that can be derived from another string by deleting zero or more characters without changing the relative order of the remaining characters.

Constraints:

• $1 \leq$ text.length $\leq 10^5$

• pattern.length $= 2$

• text and pattern consist only 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.