所有可能的长度k (k列的字符串)从一个集合(chars)长度n动态规划解决方案。

I am looking for a dynamic programming solution of getting all permutations of k length from a set of n unique strings.I am looking for a dynamic programming solution