Good, good, good, good, good.
Nothing to be specific, all good.
Online round: - One database and BFS-based problem. Interview 1st round: - Print top view of the tree. - Max profit selling stocks. Design round: - Asked to design a Google Doc-like system. Hiring manager round: - One topological sorting problem.
3 coding questions based on trees and graphs: 1. Find the set of strings from the dictionary of strings. 2. Find the maximum possible path for the given tree from the given set of nodes. 3. Shortest path sum logic in a graph question.
It was tough. The interviewers were knowledgeable and knew what they were asking. The interview process felt like a friendly conversation. Prepare well for DS and system design related questions.
Online round: - One database and BFS-based problem. Interview 1st round: - Print top view of the tree. - Max profit selling stocks. Design round: - Asked to design a Google Doc-like system. Hiring manager round: - One topological sorting problem.
3 coding questions based on trees and graphs: 1. Find the set of strings from the dictionary of strings. 2. Find the maximum possible path for the given tree from the given set of nodes. 3. Shortest path sum logic in a graph question.
It was tough. The interviewers were knowledgeable and knew what they were asking. The interview process felt like a friendly conversation. Prepare well for DS and system design related questions.