title: How to find all possible combinations of parameters and funtions
body: <p>info &amp; requirements:</p>
  
  <ol>
  <li>Two lists are given, a list of variables and a list of functions, no function requires more parameters then there are variables in the variable list.</li>
  <li>All possible combinations of input variables must be found for every function in the functions list. that means from 0 -> <code>len(variables)</code></li>
  <li>There is no guarantee that the function will accept the parameters. </li>
  <li>No edits can be made in the functions in the functions list, they can only be called. </li>
  </ol>
  
  <p>When trying to solve this myself I found a solution that could handle functions with 2 parameters, but I don't know how to make it dynamic so it can scale to infinite parameters</p>
  
  <pre><code>#  test input list
  # functions = [test_method1, test_method2]
  # variables = [1, 2, 3, 4, 5]
  
  for f in functions: 
      for v in variables:  # loop all conditions
          try:  # checks if combination throws error
              f(v)
          except TypeError as a:  # if amount of parameters is &gt; 1
              for v2 in variables:  # loop all conditions
                  try:  # tries combination
                      f(v, v2)
  
                  except TypeError as e:  
  </code></pre>
  
  <p>The above-shown code is not part of the solution, it's just my best try and is just for inspiration.</p>
  
  <p>The result should be that all functions have tried to run with all possible combination of variables as parameters.</p>