codewars #71 Triple trouble (6kyu)

#71 Triple trouble

Write a function

tripledouble(num1,num2)

which takes in numbers num1 and num2 and returns 1 if there is a straight triple of a number at any place in num1 and also a straight double of the same number in num2.

For example:

tripledouble(451999277, 41177722899) == 1 // num1 has straight triple 999s and 

                                          // num2 has straight double 99s

tripledouble(1222345, 12345) == 0 // num1 has straight triple 2s but num2 has only a single 2

tripledouble(12345, 12345) == 0

tripledouble(666789, 12345667) == 1

If this isn't the case, return 0

function tripledouble(num1, num2) {

  num1 = String(num1);
  num2 = String(num2);
  
  var triples = [];
  
	for (var i =0 ; i < num1.length - 2 ; i++ ){
		if ((num1.charAt(i) == num1.charAt(i+1)) && (num1.charAt(i) == num1.charAt(i+2))) {
			triples.push(num1.charAt(i)+num1.charAt(i+1) + num1.charAt(i+2));
		}
  }
  for(var i =0; i < triples.length; i++){
    var double = triples[i].substring(0,2);
    if(num2.indexOf(double) != -1)
      return 1;
  }
  return 0;
}

function tripledouble(num1, num2) {
  for (let i = 0; i < 10; i++) {
    if (new RegExp(`${i}{3}`).test(num1) && new RegExp(`${i}{2}`).test(num2)) {
      return 1;
    }
  }
  return 0;
}