Available question text
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.
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 3557. Find Maximum Number of Non Intersecting Substrings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source