Having a string of length $N$ with $M$ different letters, and knowing how many times each letter appears on the string, how can one calculate the amount of possible strings?
For example:
$N=10$
$M=2$
Characters $=\{A, B\}$
Amounts: $A=\{6, 4\}$
Possibilities:
AAAAAABBBB
BBBBAAAAAA
ABABABABAA
...
How can I calculate the amount of possibilities?
Edit, trying the answer provided in the comments
For these data:
$N=10$
$M=3$
Amounts $=\{2,5,3\}$
Would the solution be this one?
$$S={10\choose2}{8\choose5}{3\choose3}=45\times56\times1=2520$$