https://vhaos-leetcode-solutions.now.sh/tags/depth-first-search/ Recent content in Depth-first search on Vhaos's Leetcode Solutions Hugo -- gohugo.io en-us Kareem Daggash Sat, 18 Jul 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/july/18-course-schedule-ii/ Sat, 18 Jul 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/july/18-course-schedule-ii/ LeetCode July - Day 18 Problem Statement There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1] Given the total number of courses and a list of prerequisite pairs, return the ordering of courses you should take to finish all courses.