Implementation of an algorithm to find potential meeting opportunities of two people represented by their calendars in such a way that they do not conflict with any other meeting recorded in the calendar. The parameter is the expected length of the meeting. In response, we receive a list of time intervals that can be used by both people during working hours.
-
Notifications
You must be signed in to change notification settings - Fork 0
Implementation of an algorithm to find potential meeting opportunities of two people represented by their calendars in such a way that they do not conflict with any other meeting recorded in the calendar. The parameter is the expected length of the meeting. In response, we receive a list of time intervals that can be used by both people during w…
bartlomiejgraczyk/lets-meet-algorithm
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Implementation of an algorithm to find potential meeting opportunities of two people represented by their calendars in such a way that they do not conflict with any other meeting recorded in the calendar. The parameter is the expected length of the meeting. In response, we receive a list of time intervals that can be used by both people during w…
Resources
Stars
Watchers
Forks
Packages 0
No packages published