Consider that you have n events with their start and finish time, the objective is to find solution set having maximum number of non-conflicting events that can be conducted in a single time frame, assuming that only one auditorum or hall is available for conducting.
theritik01/TASK-SCHEDULER
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|