I applied through college or university. I interviewed at Google
Interview
No intros were given directly started with DSA round and asked question on a DFS problem, the question was easy and solved it using some non-optimal approach. The time complexity they expected was much optimal.
Interview questions [1]
Question 1
2 DSA Question related to DFS/BFS and greedy approach asked and it's optimal approach?
45 min 2 technical interviews, scheduled on different dates. You will be asked 1 DSA problem with an extension or 2 different DSA problems. You will have to explain your approach, and then tell the time complexities and finally code it up.
Interview questions [1]
Question 1
Graph based problem, if it would be possible to convert a graph such that each node can be connected to at max 3 other nodes, into a tree(binary tree)
I applied through college or university. The process took 1 day. I interviewed at Google (Chennai) in Jun 2023
Interview
1st Round was based on simple dsa question, it is easy some array question, which can be easily solved in 20 minutes. 2nd Round was medium level question based on graphs