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.