title: Check Large Number Divisible 13 Not
signature: function checkLargeNumberDivisible13Not(num: string): boolean {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: boolean, expected: boolean): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(num: string, expected:boolean): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(num),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver("vzTUaItpCpLnjY", false);
    console.log(`TEST-0...${result}`);
  
    result = driver("33855", true);
    console.log(`TEST-1...${result}`);
  
    result = driver("0011110101011", true);
    console.log(`TEST-2...${result}`);
  
    result = driver("MMQ", false);
    console.log(`TEST-3...${result}`);
  
    result = driver("439340517954", true);
    console.log(`TEST-4...${result}`);
  
    result = driver("000000000", true);
    console.log(`TEST-5...${result}`);
  
    result = driver("UugAuRRJbjEgl", true);
    console.log(`TEST-6...${result}`);
  
    result = driver("6406553695441", true);
    console.log(`TEST-7...${result}`);
  
    result = driver("011001", true);
    console.log(`TEST-8...${result}`);
  
    result = driver("yjFqEEvgiNjEX", true);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
source_py: def check_large_number_divisible_13_not(num):
      length = len(num)
      if ((length == 1) and (num[0] == '0')):
          return True
      if ((length % 3) == 1):
          num = (str(num) + '00')
          length += 2
      elif ((length % 3) == 2):
          num = (str(num) + '0')
          length += 1
      sum = 0
      p = 1
      for i in range((length - 1), (- 1), (- 1)):
          group = 0
          group += (ord(num[i]) - ord('0'))
          i -= 1
          group += ((ord(num[i]) - ord('0')) * 10)
          i -= 1
          group += ((ord(num[i]) - ord('0')) * 100)
          sum = (sum + (group * p))
          p *= (- 1)
      sum = abs(sum)
      return ((sum % 13) == 0)
source_cpp: bool check_large_number_divisible_13_not(string num) {
    int length = num . size ( );
    if ( length == 1 && num [ 0 ] == '0' ) return true;
    if ( length % 3 == 1 ) {
      num += "00";
      length += 2;
    }
    else if ( length % 3 == 2 ) {
      num += "0";
      length += 1;
    }
    int sum = 0, p = 1;
    for ( int i = length - 1;
    i >= 0;
    i -- ) {
      int group = 0;
      group += num [ i -- ] - '0';
      group += ( num [ i -- ] - '0' ) * 10;
      group += ( num [ i ] - '0' ) * 100;
      sum = sum + group * p;
      p *= ( - 1 );
    }
    sum = abs ( sum );
    return ( sum % 13 == 0 );
  }