You are given a partially-ordered sequence of n computer science theory exercises, drawn from k books stacked randomly on your desk. Provide an algorithm to solve them all in O(k log n) time before your Google interview on Monday. In parallel your algorithm must entertain your five year old daughter (a rogue process who doesn't respect mutex locks on brain resource allocation) who has just come home with an adorable furry spider toy that she wants to scare you with.
Shared with: Public
This post was originally on Google+