Subsequences with a Unique Middle Mode II

Count the number of odd-length subsequences of an array whose central element (by subsequence order) is the strictly most frequent value — i.e., the unique mode of that subsequence. The challenge is to compute this count efficiently for large inputs by combining frequency-based combinatorics and aggregated counting techniques rather than brute-force enumeration.