Meta

I only made it to the first round and was rejected. I had the most optimal solution in all cases but forgot to mention a more optimal solution that was possible in some cases, which led to my rejection. I was stunned when I was rejected, but later

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.