Min number of swaps greedy

minSwaps.js

var minSwaps = function(s) {
    let close = 0
    let maxClose = 0
    
    for (const letter of s.split('')) {
        if (letter == "[") {
            close -= 1
        } else {
            close += 1
        }
        maxClose = Math.max(maxClose, close)
    }
    return Math.floor((maxClose + 1) / 2)
};

Original problem, Naiv solution

https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/