Interview 1: simple algorithms on tree Interview 2: simple application of heap Interview 3: splitting a rectangle into squares Interview 4: variants of finding shortest path between grid cells, extension for multithreading Interview 5: segment tree In general, not very difficult or surprising for me. Preparation is definitely required. It might not be too hard for me because I have long time interest in coding algorithms for fun, and to serve my Phd research.

In-person technical interview problem involved clever usage of hashmaps and hashsets.