Burly Numbers
In an array
with integer elements in the range
to
, we call a number
burly
if it occurs at least
times in
. Which of the following is the best scheme for efficiently finding all the
burly
numbers in
.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!