convore.json/groups/hacker-news/how-to-outsmart-zappos-coding-challenge/messages.json

[{"user_id": 24848, "stars": [], "topic_id": 16390, "date_created": 1301540661.7653561, "message": "A couple of days ago Zappos held a coding challenge in Seattle, where the first question was to find one's way to a treasure. You were given a map, a 5x5 array where each square contained a set of directions, and the question was to find the starting point which eventually leads to a square with a treasure on it. The typical way of solving these problems (apparently) is a breadth-first algorithm, but the next day after failing the challenge, I figured out there was a much fast O(n) way of getting the answer! I wrote a short story of how it's done, including a sample code in Ruby. Check it out -- http://impulse.kirillzubovsky.com/post/4201509238/zappos-challenge ", "group_id": 95, "id": 487380}]