title: Number Is Divisible By 29 Or Not
signature: function numberIsDivisibleBy29OrNot(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(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(29, true);
    console.log(`TEST-0...${result}`);
  
    result = driver(0, true);
    console.log(`TEST-1...${result}`);
  
    result = driver(65, false);
    console.log(`TEST-2...${result}`);
  
    result = driver(1419, false);
    console.log(`TEST-3...${result}`);
  
    result = driver(54, false);
    console.log(`TEST-4...${result}`);
  
    result = driver(7, false);
    console.log(`TEST-5...${result}`);
  
    result = driver(44, false);
    console.log(`TEST-6...${result}`);
  
    result = driver(34, false);
    console.log(`TEST-7...${result}`);
  
    result = driver(1160, true);
    console.log(`TEST-8...${result}`);
  
    result = driver(292929002929, true);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def number_is_divisible_by_29_or_not(n):
      while int((n / 100)):
          last_digit = int((n % 10))
          n = int((n / 10))
          n += (last_digit * 3)
      return ((n % 29) == 0)
source_cpp: bool number_is_divisible_by_29_or_not(long long int n) {
    while ( n / 100 ) {
      int last_digit = n % 10;
      n /= 10;
      n += last_digit * 3;
    }
    return ( n % 29 == 0 );
  }