Google

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

A. Coding Rounds * Scope: 70% of technical weight—primarily medium to hard-level algorithm problems. * Topics: Arrays, strings, linked lists, sorting, hash tables, recursion, trees, graphs, dynamic programming. * Approach: Start with a brute-f

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