Available question text
Given an uppercase string s, you may insert at most one uppercase letter anywhere — determine the maximum number of subsequences equal to "LCT" that can appear in the resulting string. The core challenge is to count existing "LCT" subsequences and choose the optimal single-character insertion (letter and position) to maximize the total, with s length up to 1e5.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3628. Maximum Number of Subsequences After One Inserting
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source