3628. Maximum Number of Subsequences After One Inserting

LeetCodeStringDynamic ProgrammingGreedyPrefix SumOpen on judge ↗

You are given a string s consisting of uppercase English letters. You are allowed to insert at most one uppercase English letter at any position (including the beginning or end) of the string. Return the maximum number of "LCT" subsequences that can be formed in the resulting string after at most one insertion. Example 1: Input: s = "LMCT" Output: 2 Explanation: We can insert a "L" at the

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI