GoLang Solution For LeetCode Problem: Course Schedule
Solving Course Schedule in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Input: 2, [[1,0]] Output: true Explanation: There are a total of 2 courses to take. To take course 1 you should have finished course 0. So it is possible.
Input: 2, [[1,0],[0,1]] Output: false Explanation: There are a total of 2 courses to take. To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.
- You may assume that there are no duplicate edges in the input prerequisites.
See the full details of the problem Course Schedule at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go