Arithmetic Subarrays LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @param {number[]} l
4
 * @param {number[]} r
5
 * @return {boolean[]}
6
 */
7
var checkArithmeticSubarrays = function (nums, l, r) {
8
  let result = [];
9
  for (let i = 0; i < l.length; i++) {
10
    result.push(isArithmetic(nums.slice(l[i], r[i] + 1)));
11
  }
12
  return result;
13
};
14

15
function isArithmetic(arr) {
16
  let min = Math.min(...arr);
17
  let max = Math.max(...arr);
18

19
  if (min == max) {
20
    return true;
21
  }
22

23
  let step = (max - min) / (arr.length - 1);
24

25
  if (step != Math.floor(step)) {
26
    return false;
27
  }
28

29
  let set = new Set();
30
  for (let x of arr) {
31
    if (set.has(x)) {
32
      return false;
33
    }
34

35
    set.add(x);
36
  }
37

38
  for (let x = min; x <= max; x += step) {
39
    if (!set.has(x)) {
40
      return false;
41
    }
42
  }
43

44
  return true;
45
}