TH-TMO 2009 Problem 2

Let $k$ and $n$ be positive integers with $k < n$ . Find the number of subsets of $\{1, 2, . . . , n\}$ such that the difference between the largest and smallest elements in the subset is $k$ .