CareerCup

Given a set of entries, each containing a time index and a int count value,
ie
class Entry
{
time:int
count:int
}

write a function that will give the time interval with the highest count together,

ie,
if we had entries
100, 2
100, 1
110, 10
200, 4
1000, 3
1200, 8

and we ran something like
int highestInterval(int interval_range)
highestInterval( 50 )
it would return 100, because in 100-150, you have counts 2, 1, and 10.

I managed to get a O(n^2) solution for it, but I think theres a better solution. I think it might have to do with some preprocessing of the interval buckets, but I can't figure out the solution.

Move the first n numbers in a 10 element array to the end.

I think the way to do it was to reverse the array and then reverse the first 10-n and then the last n.