Minimum Number of Swaps to Make the String Balanced LeetCode solution in JavaScript

1
/**
2
 * @param {string} s
3
 * @return {number}
4
 */
5
var minSwaps = function (s) {
6
  let stk = [];
7
  for (let c of s) {
8
    if (stk && c == "]") stk.pop();
9
    else if (c == "[") stk.push(c);
10
  }
11
  return stk.length / 2;
12
};