Given a string consisting of opening and closing brackets '{' and '}', find the minimum number of bracket reversals required to make the expression balanced. If it is impossible, return -1.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.