title: Return possible permutations for given array
body: <p>For a given list with string digits, I want to return the different string numbers that can be generated using all the elements in the list (so if there are 5 elements, the number should consist of 5 digits).</p>
  
  <p>The task is to return the possible permutations, the smallest permutation and the maximum permutation in a list.</p>
  
  <ul>
  <li>answer should be converted to integers</li>
  <li>If '0' is present in the input, it will produce string numbers with leading zeroes, this is not taken into account when they are converted to integers.</li>
  </ul>
  
  <p><em>This is my code now:</em></p>
  
  <pre><code>from itertools import permutations
  
  def proc_arr(arr):
  
  
      lst = [] # define new list
      list_of_tuples = list(permutations(arr, len(arr))) # now they are tuples in a list
  
      # convert to integers in list
      separator = [map(str,x) for x in list_of_tuples]
      together = [int(''.join(s)) for s in separator]
  
      # append to new list and return the len of possible combinations, min and max value
      lst.append(len(together))
      lst.append(min(together))
      lst.append(max(together))
  
      #print(lst)
      return lst
  
  
  proc_arr(['1','2','2','3','2','3'])
  </code></pre>
  
  <p>However, I don't understand why I do don't get the right amount of permutations.</p>
  
  <blockquote>
    <blockquote>
      <p>input: proc_arr(['1', '2', '2', '3', '2', '3']) output: [60, 122233, 332221] </p>
    </blockquote>
  </blockquote>
  
  <p>and I get [720, 122233, 332221]</p>
  
  <p>another example of input &amp; output</p>
  
  <blockquote>
    <blockquote>
      <p>input: proc_arr(['1','2','3','0','5','1','1','3']) output: [3360, 1112335, 53321110]</p>
    </blockquote>
  </blockquote>