(Java) 15.9 Variant

**daemoohn** · April 15, 2016, 10:24am

The solution to have O(1) read time and O(k) query time is a sparse array?

**daemoohn** · April 15, 2016, 12:52pm

Or a counting sort will be better suited?

**daemoohn** · April 21, 2016, 5:10am

I don’t think it will work in either case.

**tsunghsienlee** · October 3, 2016, 4:30am

It is pretty simple that you just use a hash table for storing results, and traditional selection algorithm for most visited page.

**hdchen** · September 20, 2019, 5:46am

@tsunghsienlee can you elaborate ‘traditional selection algorithm’ part? I was wondering how it can achieve O(k) query time (suppose m >> k), thanks.