I had two technical interviews, with about a two-week interval between them, plus one team matching interview on the phone. The whole process took four to five weeks. In both technical interviews, there were two simple algorithm problems. My interviewer shared a link on CollabEdit, and I coded there. All questions were quite basic, and nothing surprising happened.

Q1A: In a maze with empty spaces and walls, given a starting point and ending point, find a path (not necessarily shortest). (Just BFS, DFS...)

Q1B: If the maze is stored on multiple nodes on a cluster, what do we have to do? (No coding, just give ideas)

Q2: Given an array and a target number, tell whether there are three numbers in the array which add up to the target number. (Time complexity should be O(n^2))

Q3: Topological sort.