Count Square Sum Triples LeetCode solution in JavaScript

1
var countTriples = function (n) {
2
  let count = 0;
3
  for (let i = 1; i < n; i++) {
4
    for (let j = 1; j < n; j++) {
5
      let root = Math.sqrt(j * j + i * i);
6
      if (Number.isInteger(root) && root <= n) {
7
        count++;
8
      }
9
    }
10
  }
11

12
  return count;
13
};