A manager of a department at Google wants to schedule 15-min coffee chat between two employees every week for his 6 employees. Design and write a program to help this manager. Each employee should have a meeting with a new person. So, no meeting with the same person until they meet all the other colleagues. Use functional programming or object-oriented programing. You can have your own design to cover the requirements but you should consider a design with better time complexity. You can use any data structures (lists, dictionaries, stacks, queues, ...) The number 6 here is an example and imaging there are "n" (an even number) employees in the group (for this example n =6) Every week each employee should have a meeting and just one meeting with one person. Every week they should have a meeting with a new person. Until week 5 ( n-1 weeks) they should have a meeting with the same person. employees = [ employee_1, employee_2, employee_3, employee_4, employee_5, employee_6] It means there are 3 meeting per week. Week 1: employee_1 & employee_2 will have a coffee meeting. employee_3 & employee_4 will have a coffee meeting. employee_5 & employee_6 will have a coffee meeting. Week 2: 1 _ 3, 2 _ 5, 4 _ 6 Week 3: 1 _ 4, 2 _ 6, 3 - 5 Week 4: 1 _ 5, 2 _ 4, 3 _ 6 Week 5: 1 _6, 2 _ 3, 4 _ 5
A manager of a department at Google wants to schedule 15-min coffee chat between two employees every week for his 6 employees. Design and write a program to help this manager.
Each employee should have a meeting with a new person. So, no meeting with the same person until they meet all the other colleagues.
Use functional programming or object-oriented programing.
You can have your own design to cover the requirements but you should consider a design with better time complexity.
You can use any data structures (lists, dictionaries, stacks, queues, ...)
The number 6 here is an example and imaging there are "n" (an even number) employees in the group (for this example n =6)
Every week each employee should have a meeting and just one meeting with one person.
Every week they should have a meeting with a new person.
Until week 5 ( n-1 weeks) they should have a meeting with the same person.
employees = [ employee_1, employee_2, employee_3, employee_4, employee_5, employee_6]
It means there are 3 meeting per week.
Week 1: employee_1 & employee_2 will have a coffee meeting.
employee_3 & employee_4 will have a coffee meeting.
employee_5 & employee_6 will have a coffee meeting.
Week 2: 1 _ 3, 2 _ 5, 4 _ 6
Week 3: 1 _ 4, 2 _ 6, 3 - 5
Week 4: 1 _ 5, 2 _ 4, 3 _ 6
Week 5: 1 _6, 2 _ 3, 4 _ 5
The other answer here were not correct with the requirement.
Will vote for the right one.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
