The Problem: Matching Group Schedules The group schedule matching takes two or more arrays as input. The arrays represent slots that are already booked and the login/logout time of group members. It outputs an array containing intervals of time when all members are available for a meeting for a minimum duration expected. Sample Input Enter person1_Schedule =[[ ‘7:00’, ’8:30’], [’12:00’, ’13:00’], [’16:00’, ’18:00’]] person1_DailyAct = [‘9:00’, ’19:00’] Enter person2_Schedule = [[ ‘9:00’, ’10:30’], [’12:20’, ’13:30’], [’14:00’, ’15:00’], [’16:00’, ’17:00’ ]] person2_DailyAct = [‘9:00’, ’18: 30’] Enter duration_of_meeting =30 Sample output [[’10:30’, ’12:00’], [’15:00’, ’16:00’], [’18:00’, ’18:30’]] Implementation Have following files Project1_starter.py or project1_starter.cpp that defines functions for the algorithm described above. You will need to develop and write the functions. Describe how to run your program in the ReadMe file Input.txt containing the sample input files. Use these sample files to run your program to see whether your algorithm implementations work correctly. Have a new line character separating the sample test cases (10) At least 2 must be edge cases. Output.txt – load the sample test case result to output.txt
The Problem: Matching Group Schedules
The group schedule matching takes two or more arrays as input. The arrays represent slots that are already booked and the login/logout time of group members. It outputs an array containing intervals of time when all members are available for a meeting for a minimum duration expected.
Sample Input
Enter person1_Schedule =[[ ‘7:00’, ’8:30’], [’12:00’, ’13:00’], [’16:00’, ’18:00’]]
person1_DailyAct = [‘9:00’, ’19:00’]
Enter person2_Schedule = [[ ‘9:00’, ’10:30’], [’12:20’, ’13:30’], [’14:00’, ’15:00’], [’16:00’, ’17:00’ ]]
person2_DailyAct = [‘9:00’, ’18: 30’]
Enter duration_of_meeting =30
Sample output
[[’10:30’, ’12:00’], [’15:00’, ’16:00’], [’18:00’, ’18:30’]]
Implementation
Have following files
- Project1_starter.py or project1_starter.cpp that defines functions for the algorithm described above. You will need to develop and write the functions. Describe how to run your program in the ReadMe file
- Input.txt containing the sample input files. Use these sample files to run your program to see whether your algorithm implementations work correctly. Have a new line character separating the sample test cases (10) At least 2 must be edge cases.
- Output.txt – load the sample test case result to output.txt
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images