Log In

An algorithmic puzzle

Posted on: June 27th, 2013 by
Comments Disabled

Suppose you have an array of size n+1, each entry being an integer from 1 to n. Find a duplicate entry in linear time using only O(1) (constant) space.

via Gurmeet's puzzle page

Comments are closed.

{"result":"error", "message":"You can't access this resource as it requires an 'view' access for the website id = 1."}