Count Substrings With K-Frequency Characters II

Given a string and an integer k, count substrings in which exactly k distinct characters each occur exactly k times (so valid substrings have length k*k and balanced character frequencies). This is typically solved by combining frequency maps with a sliding-window (or enumerate target distinct counts) approach to maintain counts and efficiently test substrings.