How to solve this combinatorics problem ?

Revision en1, by sandeep007, 2019-04-27 21:26:36

Given the frequency of each lowercase character f(a), f(b)... f(z) and k. Compute the number of unique strings of length k having sorted characters.

k <= 10^5

Sum(f(i)) <= 10^5

Please provide Hints/Approach to solve this problem.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English sandeep007 2019-04-27 21:26:36 280 Initial revision (published)