Meta

A typical DFS approach on LeetCode involves recursively traversing neighbors in graphs, marking visited nodes, and backtracking once no further path extends. This systematically explores all possible routes or subtrees.

Two easy LeetCode and one normal behavioral question, including a previous project. Time is limited, so you need to solve the coding questions faster and leave time for other questions. However, it's still easier than other companies.

It was an average phone screening interview. There were two LeetCode problems. The first problem was medium, but the second problem took a lot of time. I later figured it out, but I was out of time.