Leetcode 1525. Number of Good Ways to Split a String

Given a lowercase string s (n ≤ 1e5), count the split positions where the left and right substrings have the same number of distinct letters; this is typically solved in O(n) by computing prefix and suffix distinct-count arrays and counting matches.