Skip to content

The goal is to write an algorithm that checks the availabilities of an agenda depending of the events attached to it. The main method has a start date for input and is looking for the availabilities of the next 7 days. They are two kinds of events: opening, are the openings for a specific day and they can be recurring week by week. appointment, …

Notifications You must be signed in to change notification settings

MilanVilov/rails_01

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

The goal is to write an algorithm that returns the availabilities of a calendar depending on openings and the scheduled events. The main method takes a start date as input and looks for the availabilities over the next 7 days.

They are two kinds of events:

opening -> are the openings for a specific day and they can be recurring week by week (e.g. every monday starting from a certain date)
appointment-> times when the doctor is already booked The entire product specifications are described in the provided test files. In other words, the test files describe the behavior we expect from the algorithn.

Write an algorithm that passes all the tests we provided Think beyond those provided cases, specifically: Add tests to make sure all nominal cases are covered Add tests to cover all edge cases you can identify

About

The goal is to write an algorithm that checks the availabilities of an agenda depending of the events attached to it. The main method has a start date for input and is looking for the availabilities of the next 7 days. They are two kinds of events: opening, are the openings for a specific day and they can be recurring week by week. appointment, …

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages