Minimum_swaps_for_bracket_balancing

#include <bits/stdc++.h>
using namespace std;
 

long swapCount(string s)
{
    vector<int> v;
    for (int i = 0; i < s.length(); ++i)
        if (s[i] == '[')
            v.push_back(i);
 
    int cnt = 0; 
    int p = 0;  
    long sum = 0; 
 
    for (int i = 0; i < s.length(); ++i)
    {
        
        if (s[i] == '[')
        {
            ++cnt;
            ++p;
        }
        else if (s[i] == ']')
            --cnt;
 
       
        if (cnt < 0)
        {
            sum += v[p] - i;
            swap(s[i], s[v[p]]);
            ++p;
 
            cnt = 1;
        }
    }
    return sum;
}
 

int main()
{
    string s = "[[]]][";
    cout << swapCount(s) << "\n";
 
    s = "[[][]]";
    cout << swapCount(s) << "\n";
    return 0;
}