[NEW] Add solution for Course Schedule Graph Algorithm #109
Description
🎯 Problem Information
- Problem Name: course schedule
- CSES Link: https://cses.fi/problemset/task/1679
- Category: graph algorithms
- Estimated Difficulty: medium
📋 Problem Description
You have to complete n courses. There are m requirements of the form "course a has to be completed before course b". Your task is to find an order in which you can complete the courses
💡 Proposed Approach
Describe the algorithm/approach you plan to use: i will use topological sort to solve this problem
- Time Complexity: O(n+m)
- Space Complexity: O(n+m)
📝 Implementation Notes
Any special considerations or optimizations needed:
- Requires fast I/O
- Needs modular arithmetic
- Large input constraints
- Edge cases to consider
🏷️ Labels
Please add appropriate labels:
-
hacktoberfest(if contributing during Hacktoberfest) -
good first issue(if suitable for beginners) -
help wanted(if you need assistance)
👤 Assignee
- I would like to work on this issue
- I'm available for guidance/review
📎 Additional Context
Add any other context or screenshots about the problem here.