Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3628. Maximum Number of Subsequences After One Inserting
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.