Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3557. Find Maximum Number of Non Intersecting Substrings
Given a string, pick the maximum number of non-overlapping substrings of length at least 4 whose first and last characters are the same — effectively an interval-selection problem (greedy/interval scheduling) over all valid start–end pairs in a string of length up to 2·10^5.
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.