Find the number of ways you can invite $3$ of your friends on $5$ consecutive days. Find the number of ways you can invite $3$ of your friends on $5$ consecutive days, exactly one friend a day, such that no friend is invited on more than two days. 
My approach: Let $d_A,d_B$ and $d_C$ denote the total number of days $A, B$ and $C$ were invited respectively. According to the question we must have $0\le d_A,d_B,d_C\le 2.$ Also, we must have $$d_A+d_B+d_C=5.$$ 
Now let $d_A+c_A=2, d_B+c_B=2, d_C+c_C=2,$ for some $c_A, c_B, c_C\ge 0$. 
This implies that $c_A+c_B+c_C=1$. 
Therefore the problem translates to finding the number of non-negative integer solutions to the equation $$c_A+c_B+c_C=1.$$ 
By the stars and bars method the total number of required solutions is equal to $$\dbinom{1+3-1}{3-1}=3.$$
But the number of ways to invite the friends will be higher than this, since the friends are distinguishable and we have assumed them to be indistinguishable while applying the stars and bars method. 
How to proceed after this?

The fact that the only way to achieve this is by inviting one friend over once and the other two twice will make this problem simpler.
How many ways are there to pick the one friend (from $3$) that will be only visiting one day instead of two?
Now if we assume the days are Monday through Friday, how many ways are there to pick the day that the one-day friend will visit?
Finally, for the remaining four days, how many ways are there to pick two of them? This will be the number of ways to arrange the remaining two friends.
Now multiply the three of these numbers together for the final answer 

A side proof as to why we must have it with one friend one day and the other two with $2$: We obviously can it have any friend arrive three days out of the five, as per given in the question. If all three come twice, this would require $6$ days so this isn't possible either. If two friends only come one day each, then we aren't using up all $5$ days.
