Given n cards numbered from 1 to n. We need to find an initial arrangement of these cards such that the following process removes the cards in the order 1, 2, 3, ..., n.Do the following for every number k from 1 to n:Move the first k cards of the
This is a summary. For the full story, refer to the original source. Public of India presents verified citizen-relevant reporting.