Challenge: Implement Depth-First Search

Try to solve the Implement Depth-First Search problem.

We'll cover the following


Given a directed graph represented by an adjacency array graph and an integer source, representing the start vertex of the graph, return an array of integers, result that shows the order of depth-first traversal starting from the specified source vertex.


  • 11 \leqgraph.length \leq10310^3

  • 103-10^3 \leqgraph[i][j] \leq10310^3


Level up your interview prep. Join Educative to access 80+ hands-on prep courses.