title: Find the minimum number of edits to balance parentheses?
body: <p>I was very confused about this question. I know about finding the edit distance between 2 strings using recursion and dynamic programming as an improvement, however am confused about how to go with this one. </p>
  
  <p>Not sure if my thinking is correct. But we have a string of parenthesis which is unbalanced say </p>
  
  <pre><code>String s = "((())))";
  </code></pre>
  
  <p>How to find the String with balanced Parenthesis which requires minimum number of edits ? </p>
  
  <p>Can some one explain this with an example ?</p>
  
  <p>I am still not sure if I am explaining it correctly. </p>