Leetcode 2743. Count Substrings Without Repeating Character

Count how many substrings of a given string contain only unique characters (no repeated characters within the substring). This is typically solved with a sliding-window/two-pointer approach (tracking last-seen positions or counts) to maintain maximal unique windows and accumulate contributions efficiently.