← Questions
Count distinct values in a sorted array
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Count the distinct values in a sorted array of length n that holds only k distinct values, where k is much smaller than n. A linear scan works; do better by jumping over each run of equal values with binary search, in about O(k log n), and explain when that wins.
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