      "## Solution Notebook\n",
      "\n",
      "Review the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/recursion_dynamic/n_pairs_parentheses/n_pairs_parentheses_solution.ipynb) for a discussion on algorithms and code solutions."
     ]
    },
    {
     "cell_type": "code",
     "execution_count": null,
     "metadata": {
      "collapsed": true
     },
     "outputs": [],
     "source": []
    }
   ],
   "metadata": {
    "kernelspec": {
     "display_name": "Python 2",
 
</s> remove    "display_name": "Python 2",
 </s> add    "display_name": "Python 3", </s> remove    "display_name": "Python 2",
 </s> add    "display_name": "Python 3", </s> remove     "def parentheses_util(no_left, no_right, pair_string, result):\n",
    "    # TODO: implement parentheses pairing here\n",
    "    pass\n",
    "\n",
 </s> add     "class Parentheses(object):\n", </s> remove    "name": "python2"
 </s> add    "name": "python3" </s> remove    "name": "python2"
 </s> add    "name": "python3"
      "## Solution Notebook\n",
      "\n",
      "Review the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/recursion_dynamic/n_pairs_parentheses/n_pairs_parentheses_solution.ipynb) for a discussion on algorithms and code solutions."
     ]









    }
   ],
   "metadata": {
    "kernelspec": {
     "display_name": "Python 2",
keep keep keep keep replace replace replace replace replace replace replace replace replace keep keep keep keep keep
 Rework n pairs parens challenge (#145) 
recursion_dynamic/n_pairs_parentheses/n_pairs_parentheses_challenge.ipynb