Hello,

I got this puzzle asked to me in a recent interview in an MNC company.

Suppose you are working in a tv channel and your job is to schedule the advertisements in between the TV program breaks.

Now there are 2 types of advertisements: Advt A and Advt B.

You have to show Advt A 6 times and Advt B 2 times in 30 minutes slot.

Suppose both advt are 1 minute each.

Now you have to schedule these advt such that the advt of same kind are as far as possible. No more clues and no more clarification I can provide more than what I have given because this is what I was asked exactly.

And this is the problem the company is working on and trying to find an algorith for this.