#8 - Local, Could Be True, Min/Max

[KwakuS]

Hello,

Thank you for all the responses to this question. I noticed that in the solution, it stated that we should put as many Ls as we could before one G, or as many Gs as we could before one L. I can understand this approach, but would it have also been possible to do a mix between the two? Such as seeing if we could put 2 Ls and 2 Gs and still get a maximum? Or would that not have worked?

Thanks,
Kwaku

[Rachael Wilkenfeld]

Hi Kwaku,

I think you have it a bit turned around. We put either as many Ls as we can before one G, or as many Gs as we can after one L. We couldn't put any Ls after any number of Gs in this case.

Your suggestion wouldn't work here. Let's try and put two Ls before two Gs.

We would put L on Thursday before H and H followed by L on Friday. We couldn't add a G to Friday because Friday has either G or L but not both. We couldn't do two Gs on Saturday because a movie is shown at most once a day. So once we put in our two Ls, we can't also have two Gs. It's a smaller group size than the maximum.

Hope that helps!

[KwakuS]

Ok, makes sense! Thanks!

Kwaku