3859. Count Subarrays With K Distinct Integers

You are given an integer array nums and two integers k and m. Return an integer denoting the count of subarrays of nums such that: - The subarray contains exactly k distinct integers. - Within the subarray, each distinct integer appears at least m times. Example 1: Input: nums = [1,2,1,2,2], k = 2, m = 2 Output: 2 Explanation: The possible subarrays with k = 2 distinct integers, each app