Question d’entretien chez Indeed

Basic algorithm questions, such as find the shortest path from root to leaf