Interview Puzzles :: Discussion
There are n glasses on the table, all standing upside down. In one move, you are allowed to turn over exactly n â€“ 1 of them. Determine all values of n for which all the glasses can be turned up in the minimum number of moves.
No Best Answer on this question yet!
Asked In : Sapient