Objects seen on both days by at least two clients
Two log files, one per day, hold lines of timestamp, object_id, client_id. Return the object ids that appear on both days and were accessed by at least two different clients. Then: what is the cost of your set intersection, and how do you do it when the files do not fit in memory (sort each file, then merge with two pointers)?
GoogleTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.