Leetcode 2953. Count Complete Substrings

Count the number of contiguous substrings where every distinct character appears exactly k times and every adjacent pair of characters differs by at most 2 positions in the alphabet. With word length up to 1e5, you must efficiently combine per-character frequency constraints with the local adjacency restriction to enumerate valid substrings.