Leetcode 828. Count Unique Characters of All Substrings of a Given String

Compute the sum, over all substrings of s, of how many characters appear exactly once in that substring. The core challenge is to count each character occurrence’s total contribution to all substrings efficiently (e.g., using previous/next occurrence distances) to handle s up to 1e5 without enumerating all substrings.