Google SWE Intern interview questions

In the first round they asked a qs of topological ordering and asked me the name of algorithm which i applied to solve that question the answer was kann's algorithm In the second round, They asked me a question about string handling which finally boiled down to a tree traversal kind of question this was medium level question mainly focused on testing implementation skills

I was asked a question from array .it is a standard leetcode question."merging subintervals" with a little additional subproblem in it.