Top K similar movies from a similarity graph
Movies are nodes with a rating, and an edge links two similar movies; similarity carries across edges. Given a movie and k, return the k highest-rated movies reachable from it, not counting the movie itself. Traverse with BFS and keep the best k in a heap. Follow-up: what problems would this have in production, and how would caching help?
GoogleCodingNo answer yet. Write the first one; the best answer gets endorsed.