Google

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

The interview has one OA and three technical interview rounds. Each round is 1 hour (45 minutes for DSA and 15 minutes for Googliness). In all rounds, they asked about one coding question and follow-ups depending on time.

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