Count subarrays with at least k equal pairs
Given an integer array and k, count the contiguous subarrays that contain at least k pairs of indices i < j with equal values. For example, [0, 1, 0, 1, 0] with k = 2 has 3 such subarrays.
UberOnline assessmentNo answer yet. Write the first one; the best answer gets endorsed.