Google

Face-to-face interview on coding and DSA: * Trees * Greedy algorithms * Pointers * Linked lists * Nodes * Data structures * Time and space constraints

It was pretty lengthy, but I maintained a positive attitude towards learning and asking questions. I considered edge cases, constraints, and the procedure. We discussed time complexity and space complexity, and I was prepared to follow up if asked. I

First, I received a telephone interview round, where I was rejected due to a backlog. This was quite surprising because I thought the founder of Google was a college dropout.