title: All possible permutations of length k (k legth string ) from a set (array of chars) length n dynamic programming solution
body: <p>I am looking for a dynamic programming solution of getting all permutations of k length from a set of n unique strings.</p>
  
  <p>Example:</p>
  
  <p>array = {"A","B","C","D","E","F","G"}; // n = 7
  example permutations = {ABC}, {ABD}, {ABE} etc // k = 3</p>
  
  <p>I have an approach to solve this, as first to generate combinations, then generate all possible permutations of that combination. Combinations can be generated using dynamic programming like solving Binomial Coefficient problem using DP. </p>
  
  <p>Thoughts? </p>