LeetCodeDailyChallenges/AllPathsFromSourcetoTarget.html at main · Mohityadav-code/LeetCodeDailyChallenges · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>LeetCode day 4</title>
    <style>
        body {
            background: yellowgreen;
        }

        pre{
            font-size: 20px;
            color: rgb(17, 0, 255);
            display: flex;
        }
        #que{
            color: rgb(255, 0, 204);
            font-size: 30px;
            margin: 0;
            position: relative;
            left: -100px;
        }
    </style>
</head>

<body>
    <pre id="que">
        Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all possible paths from node 0 to
        node n - 1 and return them in any order.

        The graph is given as follows: graph[i] is a list of all nodes you can visit from node i (i.e., there is a
        directed edge from node i to node graph[i][j]).
    </pre>
    <pre>
        <img src="https://assets.leetcode.com/uploads/2020/09/28/all_1.jpg" alt="">
        Example 1 :
        Input: graph = [[1,2],[3],[3],[]]
        Output: [[0,1,3],[0,2,3]]
        Explanation: There are two paths: 0 -> 1 -> 3 and 0 -> 2 -> 3.
    </pre>
    <pre>
        <img src="https://assets.leetcode.com/uploads/2020/09/28/all_2.jpg" alt="">
        Example 2 :
        Input: graph = [[4,3,1],[3,2,4],[3],[4],[]]
        Output: [[0,4],[0,3,4],[0,1,3,4],[0,1,2,3,4],[0,1,4]]
    </pre>
</body>
<script>
    console.log("hello world");
    console.log("i get a next level happiness when i understand the question ");
    console.log("i will solve it after completing assignments");

</script>
</html>