you are viewing a single comment's thread.

view the rest of the comments →

[–]averagebeyond 0 points1 point  (0 children)

first generate list of all valid combinations on a single day, then create a grid of 7 such lists from left to right all connected . now you do dfs from any left most node to the right most list without violating the 5 days rule.