News for hackers. Stuff that matters.
Re:Google's “Director of Engineering” Hiring Test by bogomipz on Thursday October 13, 2016 @07:15PM (#12704979)
"For the case where you want to minimize the probability that two inputs which are highly similar land in the same bucket, you want a crypto hash"

That's what I was trying to say:

"a tiny change in the input causes a substantial change in the output."

But I probably didn't articulate that very well. I think we are saying the same thing.

You mentioned:

"The problem is that as the input values counts approach sqrt(output value size), you're going to start getting collisions"

Can you elaborate on the significant a square root here? Does this relate to the load factor?

Re:Google's “Director of Engineering” Hiring Test by dekhn on Thursday October 13, 2016 @07:32PM (#12705069)
https://en.wikipedia.org/wiki/Birthday_problem Basically, you get 50% chance of collision around sqrt(size of table).
Re:Google's “Director of Engineering” Hiring Test by bogomipz on Friday October 14, 2016 @03:02PM (#12710335)
Ah right, a probability theory classic. Thanks, cheers.