Log In


Posted on: February 21st, 2014 by
Comments Disabled

Suppose you have an array of size n, where each element in the array is either 0, 1 or 2. How will you compute the minimum number of swaps required to sort the array in O(n) time?

- via Algorithmic Fest at Stanford

Comments are closed.

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