title: Finding unique combinations of tuples
body: <pre><code>Input: 1 2 3 4
  Output: (1,2)(3,4)
  (1,3)(2,4)
  (1,4)(2,3)
  </code></pre>
  
  <p>I have been able to come up with a solution for the problem but it is efficient. It needs to be optimized.</p>
  
  <pre><code>comb = combinations(Arr,int(n/2))
  l = []
  for i in comb:
      l.append(i)
  final_comb = combinations(l,int(n/2))
  for i in final_comb:
      if is_unique(n,i):
         print(i)
  
  def is_unique(n,tup):
      k = []
      for i in tup:
          for j in i:
              k.append(j)
      if len(set(k)) == n:
          return True
      return False
  </code></pre>
  
  <p>The output must be combinations of tuples such that they all have the numbers given as input</p>