Google Summer Intern interview questions

How to convert a given overlapping set of intervals to non overlapping intervals. Followed by analysis the space and time complexity. After discussing the brute force solution I was asked to optimise the solution further.

Purely DSA based questions - leetcode medium level in first round and one leetcode hard in second round. Talking out loud while coding is most crucial. The topics were mostly dynamic programming and graphs - breadth first and depth first search