Assigning Candidates to Interviewers Problem

Revision en2, by viralm, 2022-05-09 23:31:38

We want to schedule interviews for N candidates. We have M intervewers who are available for interviewing candidates.

Each candidate and interviewer provides a time interval during which they are available for interviews. Find the maximum number of interviews that can be scheduled assuming each interview is 1 hour long.

The interval times are between 0 hours to 24 hours with granularity of 30 minutes. For example, the time intervals: [0, 3], [22.5, 24] are valid intervals but time intervals like: [0.7, 2] are invalid.

N < 1000
M < 1000

Input: Candidate intervals is a list of lists. The inner list is of the format: [start time, end time, candidate id] Interviewer intervals is a list of lists. The inner list is of the format: [start time, end time, interviewer id]

Output: Single integer denoting the maximum number of interviews that can be scheduled.

Tags maximum matching

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en6 English viralm 2022-05-09 23:40:25 62
en5 English viralm 2022-05-09 23:39:46 207
en4 English viralm 2022-05-09 23:34:36 3 Tiny change: 'didate id]\nIntervie' -> 'didate id].\n\nIntervie'
en3 English viralm 2022-05-09 23:33:29 34
en2 English viralm 2022-05-09 23:31:38 18
en1 English viralm 2022-05-09 23:29:39 924 Initial revision (published)