Sollicitatievraag bij Google

Basic stuff: relatively practical problems use stack, queue, binary search. None expected. For example, maximum points on a line given a list of coordinates, 3 sum variants: a+b+c<target integer for a given unsorted into array, RPN. Some design questions, touched consistent hashing.