Source: Sent to me by Piyush Sao (EE IITM Alumnus, Georgia Tech Grad Student)
Given a arbitrary binary string of length n, find three evenly spaced ones within the string if they exist. Write an algorithm which solves this in O(n * log(n)) time.
Update (29th January 2013):
Solution posted by JDGM in comments!