← Questions
Count subarrays with at least k equal pairs
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding