DIY: Course Schedule II

Problem statement

There is a total of n courses labeled from 0 to n - 1. Some courses may have prerequisites. For example, if prerequisites[i] = [ai, bi], you must take course b before course a.

Given the total number of courses n and a list of the prerequisite pairs, return the course order one should take to finish all of the courses.

Input

Here is an example input:

n = 4 
prerequisites = [[1,0],[2,0],[3,1],[3,2]]

Output

Here is an example output:

[0,2,1,3]

Another valid ordering is [0,1,2,3].

Coding exercise

Implement the findOrder(n, prerequisites, courses) function, where n is the number of courses, prerequisites is the list of prerequisites and courses is the output array containing the order in which a student can take all of the courses.