LC_1971

class Solution {

    public boolean validPath(int n, int[][] edges, int source, int destination) {

        List<Integer>[] graph = new ArrayList[n];

        for(int i = 0; i < n; i++) {
            graph[i] = new ArrayList<>();
        }

        for(int[] edge : edges) {
            graph[edge[0]].add(edge[1]);
            graph[edge[1]].add(edge[0]);
        }

        boolean[] visited = new boolean[n];

        return dfs(source, destination, graph, visited);
    }

    private boolean dfs(int node, int destination,
                        List<Integer>[] graph,
                        boolean[] visited) {

        if(node == destination)
            return true;

        visited[node] = true;

        for(int neighbour : graph[node]) {

            if(!visited[neighbour]) {

                if(dfs(neighbour, destination, graph, visited))
                    return true;
            }
        }

        return false;
    }
}