Uber interview problem

Revision en1, by wocagav, 2022-08-09 10:33:39

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.


  Rev. Lang. By When Δ Comment
en1 English wocagav 2022-08-09 10:33:39 377 Initial revision (published)