Maximum Subset Sum With No Repeating Digits

Find Maximum Subset Sum which Can be obtained from an Array of Numbers where No Two Elements in subset have same digit.

  array[] = { 121 , 333 , 3 , 4 , 23 , 12 }
  Maximum Sum = 458
  Subset[] = { 121 , 333 , 4 }