Google

Hard DSA questions: trees, graphs. Basically, you need optimistic ways to approach a solution. I am able to solve 2 out of 4 questions based on arrays, binary search trees, and one linked list question.

I applied through college or university. The process took 1 day. First there was an OA in which two easy to medium questions were asked of stacks and queues, and later on there were two DSA rounds in each of which 2 questions were asked: one medium

Phone screen A chessboard was given where something could move based on some conditions. This suggested DFS/BFS on a 2D array/graph. It wasn't very straightforward, so I'd rate it slightly hard – harder than any of my onsite interviews. Completed wi