Max Number of K-Sum Pairs LeetCode solution in JavaScript

1
var maxOperations = function (nums, k) {
2
  let freq = new Map(),
3
    count = 0;
4
  for (let i = 0; i < nums.length; i++) {
5
    if (freq.get(k - nums[i])) {
6
      if (freq.get(k - nums[i]) == 1) freq.delete(k - nums[i]);
7
      else freq.set(k - nums[i], freq.get(k - nums[i]) - 1);
8
      count++;
9
    } else freq.set(nums[i], freq.get(nums[i]) + 1 || 1);
10
  }
11
  return count;
12
};