You are given a string s consisting of uppercase English letters.

You can insert at most $1$ uppercase English letter at any position in s.

Return the maximum number of subsequences equal to "LCT" that can be formed after the insertion.

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

Constraints:

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

• s consists of uppercase 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.