There are 2n glasses standing next to each other in a row, the first n of them are filled with a soda drink, while the remaining n glasses are empty. Make the glasses alternate in a filledempty- filled-empty pattern in the minimum no of glass moves.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected].
