Work-life balance can be improved.
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.
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.
5 interviews: * 1 behavioral * 4 DSA The DSA interviews included 1 LeetCode Medium and 1 LeetCode Hard. The questions were challenging for me. The final round was behavioral, asking questions about previous employment and college projects.
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.
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.
5 interviews: * 1 behavioral * 4 DSA The DSA interviews included 1 LeetCode Medium and 1 LeetCode Hard. The questions were challenging for me. The final round was behavioral, asking questions about previous employment and college projects.