How to solve below problem statement.
given a string s which contains only curly braces and questions was what is the minimum number of operations to become it valid expression and return corrected string. There are three operations:
insert { or } in any position
delete { or } in any position. flip any position so { change by } or vice versa.