067_count reversals.cpp

//author :shreyamalogi

//Given a string S consisting of only opening and closing curly brackets '{' and '}', find out the minimum number of reversals required to convert the string into a balanced expression.
//A reversal means changing '{' to '}' or vice-versa.


//already done this prob in parenthesis
//same thing.

#include<bits/stdc++.h>

using namespace std;

int main()
{

     return 0;
}