How many 10-character strings can be made having only 4 letters of 'a', 'b', 'c' and 'd' (16 in total)
I know how many there are 16-char strings $$ \frac{16!}{4!4!4!4!} $$
How to avoid using multiple case scenario with above technique? Is there a generic solution to this kind of problem?