# Challenge: Implement Depth-First Search

Try to solve the Implement Depth-First Search problem.

## We'll cover the following

## Statement

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.

**Constraints**

$1$ $\leq$ `graph.length`

$\leq$ $10^3$ $-10^3$ $\leq$ `graph[i][j]`

$\leq$ $10^3$

## Examples

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