Leetcode 2730. Find the Longest Semi-Repetitive Substring

Given a digit string, return the length of the longest contiguous substring that contains at most one adjacent equal pair (i.e., no more than one index i with s[i] == s[i+1]). This is essentially a sliding-window/two-pointer problem tracking the count of adjacent duplicate pairs.