Scheduler
Events, dates and times with conflict detection and free-slot finding.
Project 9Advanced
๐งฉ Problem statement
Events, dates and times with conflict detection and free-slot finding. Design it completely in pseudocode first: plan the data, split the work into functions, write the logic, dry-run it and test it.
๐ Requirements
- Events
- Dates
- Time
- Conflicts
- Availability
- Sorting
๐ฅ Inputs
- Event name, start and end time
๐ค Outputs
- Sorted schedule
- Conflicts
- Free slots
๐ Rules
- Two events conflict if their times overlap
๐ง Constraints
- Times in 24-hour format
๐งญ Suggested approach
- Restate the problem in your own words
- List the data you must remember (variables, lists, maps)
- Write one FUNCTION per feature
- Write the main program that calls them
- Dry-run with the Run button
- Test normal cases and edge cases
๐ง Required concepts
- Data structures
- Algorithms
- Complexity
โ๏ธ Pseudocode editor ยท dry-run tool ยท test cases
Design your solution here. Use Run to dry-run it step by step. Hints unlock one at a time โ try on your own first!
๐งช Edge cases to test
- Empty input
- Very large values
- Repeated or duplicate entries
๐ Challenge extensions
- Add a feature of your own
- Make it work for 10ร more data โ what changes?
