Leetcode 2537. Count the Number of Good Subarrays

Count the number of contiguous subarrays that contain at least k pairs of equal elements (i<j with arr[i]==arr[j]). This is typically solved with a sliding-window / two-pointer approach maintaining element frequencies and the running count of equal pairs to enumerate valid subarrays in linear time.