This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
MIT License
47
stars
98
forks
source link
[ISSUE-287] add program to solve CourseSolution problem #292
Approach: Topological Sorting, Cycle Detection
Let's try to think of prerequisites pairs as an edge between two nodes in a graph.
Now this problem becomes simple, we just need to find out if there is any cycle in a graph or not.
If there is no cycle, then we can finish all the courses otherwise the answer is no.
Screenshots(Attach 2 screenshots of your own input and output) -
Attach here
Checklist:
Eg - If your code follow the below guidelines. Kindly change [] to [x]
All the conditions should be fulfilled for considering your code for merging -
[x] I have mentioned the question as comment in my solution file.
[x] My code follows the guidelines of this project.
[x] I have performed a self-review of my own code.
[x] I have commented my code.
[x] My code gives the correct output.
[x] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.
[x] I affirm that I strictly follow contributing guidelines and code of conduct.
Issue Id you have worked upon -
287
Briefly explain your program logic -
Approach: Topological Sorting, Cycle Detection Let's try to think of prerequisites pairs as an edge between two nodes in a graph. Now this problem becomes simple, we just need to find out if there is any cycle in a graph or not. If there is no cycle, then we can finish all the courses otherwise the answer is no.
Screenshots(Attach 2 screenshots of your own input and output) -
Attach here
Checklist:
Eg - If your code follow the below guidelines. Kindly change [] to [x]
All the conditions should be fulfilled for considering your code for merging -
[x] I have mentioned the question as comment in my solution file.
[x] My code follows the guidelines of this project.
[x] I have performed a self-review of my own code.
[x] I have commented my code.
[x] My code gives the correct output.
[x] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.
[x] I affirm that I strictly follow contributing guidelines and code of conduct.