Cryptorihm

function isCryptSolution(crypt, solution) {

  const map = {};
  for(let m of solution) {
    map[m[0]] = m[1];
  }

    
  for(let i in crypt) {
    const line = crypt[i];
    if( line.length > 1 && map[line[0]] == "0" )
        return false;
    crypt[i] = line.split('').reverse().join('');
  }

  let carry = 0;
  const lenCrypt = crypt[2].length;
  
  for(let i=0; i < lenCrypt || carry; ++i) {
    const a = ~~map[crypt[0][i]],
          b = ~~map[crypt[1][i]],
          c = ~~map[crypt[2][i]];
      const sum = a + b + carry;
      carry = sum/10|0;
      if (sum%10 != c) return false;
  }
  return true;
}