Minimum Deletions to Make Array Divisible LeetCode solution in JavaScript

1
var minOperations = function (nums, numsDivide) {
2
  nums.sort((a, b) => a - b);
3
  let set = new Set();
4

5
  for (let i = 0; i < nums.length; i++) {
6
    let item = nums[i];
7
    if (!set.has(item)) {
8
      let quantity = 0;
9

10
      for (let j = 0; j < numsDivide.length; j++) {
11
        if (numsDivide[j] % item !== 0) {
12
          set.add(item);
13
          quantity = nums.lastIndexOf(item) - i + 1;
14
          break;
15
        }
16
      }
17

18
      if (quantity === 0) return i;
19
    }
20
  }
21

22
  return -1;
23
};