Medium Problemscountingcombinatoricslinear
Count Derangements
Given n distinct objects, each with one designated original position, count the permutations in which no object ends up back in its own original position.
Do this lesson first: climbing stairsThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.