Databases
StackOverflow2013
Postsdbo
POGiven a schedule find all conflicting appointments for a doctors office
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POGiven a schedule find all conflicting appointments for a doctors office
    primarykey
    data
    text
    <p>You are given 'n' appointments. Each appointment contains startime and endtime. You have to retun all conflicting appointments efficiently starttime and endtime can range from a few min to few years. I saw the post: <a href="https://stackoverflow.com/questions/12283559/find-overlapping-appointments-in-on-time">FInd overlapping appointments in O(n) time?</a> which is very similar to this. But a doubt remains. </p> <p>My question is that if we have a sorted schedule given, say : (6:30-6:35), (6:40-7:10) (7:25-7:40), (7:35-7:50) and so on.</p> <p>Can we not traverse the schedule list and make sure that the next appointment should begin ONLY after the previous one is over? In that case we're applying a very tight bound on the possible time for scheduling an appointment. In this example, we know that the appointment beginning at 7:35 is before last appointment ends (7:40) so it is a conflict. Do we really need to complicate the solution by creating a tree or hash map as mentioned in the most rated solution in link for similar question?</p> <p>Please point out cases which can bypass this check and prove this condition invalid. </p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USCommunity
    1. USuser1071840
    plurals
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POGiven a schedule find all conflicting appointments for a doctors office
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POGiven a schedule find all conflicting appointments for a doctors office
      1. USDMack
      1. VTFavorite
    1. COThank you for the quick response. I wanted to make sure because the solution stated that, "The algorithm basically involves checking whether the next appointment is overlapped by _**any**_ previous ones."
      singulars
      1. POGiven a schedule find all conflicting appointments for a doctors office
      1. USuser1071840
    2. COYou do have to check *any* previous ones. The appointment doesn't necessarily overlap the one immediately prior, eg: `(0, 5), (2, 3), (4, 8)` The third appointment overlaps the first one but not the second. However, you don't actually have to compare each appointment to every other appointment to achieve this, you can just keep track of the latest end time you have seen so far.
      singulars
      1. POGiven a schedule find all conflicting appointments for a doctors office
      1. USverdesmarald
    3. COBut if we just need to find out if there are any overlaps at all, we'll stop at the second one itself. You are right when you say, "The third appointment overlaps the first one but not the second. " but second one begins before first has ended so we never really go to the third.
      singulars
      1. POGiven a schedule find all conflicting appointments for a doctors office
      1. USuser1071840
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload