This question is in reference to the programming question found here.
What method of approach should I be thinking of if I have a list of lectures A, B, and C, and discussions D, E, and F, that are taught at times X, Y, and Z. Given that I must enroll in both a lecture and a discussion for each course, and I want to find out how to get all non-overlapping combinations of unique courses?
Might consider making each unique class-discussion-lecture date object into a matrix like this: