title: Minimum Sum Two Numbers Formed Digits Array 2
signature: function minimumSumTwoNumbersFormedDigitsArray2(a, n) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(a, n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(a, n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver([4, 16, 29, 30, 38, 83], 5, 918);
    console.log(`TEST-0...${result}`);
  
    result = driver([58, 74, -28, -60, -6, 66, -76, 46, 0, -24, 28, -16, -14, 24, -94, -56, -80, 40, -18, -68, -8, -94, -88, -12, -20, -8], 16, -2063616120);
    console.log(`TEST-1...${result}`);
  
    result = driver([0, 1], 1, 0);
    console.log(`TEST-2...${result}`);
  
    result = driver([7, 12, 78, 8], 3, 90);
    console.log(`TEST-3...${result}`);
  
    result = driver([-78, -48, -48, -26, 8, 34], 4, -1334);
    console.log(`TEST-4...${result}`);
  
    result = driver([1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0], 27, 2222222);
    console.log(`TEST-5...${result}`);
  
    result = driver([2, 3, 5, 7, 25, 30, 31, 38, 42, 45, 52, 53, 56, 59, 60, 71, 74, 76, 80, 90, 91, 98], 13, 3190079);
    console.log(`TEST-6...${result}`);
  
    result = driver([0, 0, 0, 0, 0, 0, 1, 1, 1], 8, 2);
    console.log(`TEST-7...${result}`);
  
    result = driver([59, 9, 3, 20, 83, 87, 48, 4, 86, 67, 89, 96, 17, 36, 39, 45, 99, 8, 56, 92, 63, 81, 7, 75, 32, 10, 71, 82, 97, 92, 65, 23, 22, 47, 70, 79, 57, 81, 65, 50], 35, 430183530665338166);
    console.log(`TEST-8...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def minimum_sum_two_numbers_formed_digits_array_2(a, n):
      a = sorted(a)
      (num1, num2) = (0, 0)
      for i in range(n):
          if ((i % 2) == 0):
              num1 = ((num1 * 10) + a[i])
          else:
              num2 = ((num2 * 10) + a[i])
      return (num2 + num1)
source_cpp: int minimum_sum_two_numbers_formed_digits_array_2(vector<int> a, int n) {
    sort(a.begin(), a.end());
    int num1 = 0;
    int num2 = 0;
    for ( int i = 0;
    i < n;
    i ++ ) {
      if ( i % 2 == 0 ) num1 = num1 * 10 + a [ i ];
      else num2 = num2 * 10 + a [ i ];
    }
    return num2 + num1;
  }