Google Software Engineer Internship interview questions

First round is about splitting bunch of nodes into a binary tree, which is easy. Follow-up is splitting into a tree where each node has N children. Second round is a task scheduling problem which gives you a constant timeout and a series of [task ID, Starting time], more like streaming mode, then return if the a task is timeout at certain timestamp. Did not really get the idea but can be solved using dictionary.

Had to solve 2 coding questions in 45 mins. 1st interview had questions based on string manipulation and arrays. 2nd interview had question based on DP on graphs