    {
     "cell_type": "markdown",
     "metadata": {},
     "source": [
      "## Problem: Print all valid combinations of n-pairs of parentheses\n",
      "\n",
      "* [Constraints](#Constraints)\n",
      "* [Test Cases](#Test-Cases)\n",
      "* [Algorithm](#Algorithm)\n",
      "* [Code](#Code)\n",
 
</s> remove     "Review the [Solution Notebook](#) for a discussion on algorithms and code solutions."
 </s> add     "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." </s> remove     "    return result_set\n"
 </s> add     "    return result_set" </s> remove    "execution_count": 1,
 </s> add    "execution_count": null,
    "## Problem: Print all valid combinations of n-pairs of parentheses.\n",
    {
     "cell_type": "markdown",
     "metadata": {},
     "source": [
    "## Problem: Print all valid combinations of n-pairs of parentheses.\n",
      "\n",
      "* [Constraints](#Constraints)\n",
      "* [Test Cases](#Test-Cases)\n",
      "* [Algorithm](#Algorithm)\n",
      "* [Code](#Code)\n",
keep keep keep keep replace keep keep keep keep keep
 Cleaned up n pairs parentheses challenge notebook. 
recursion_dynamic/n_pairs_parentheses/n_pairs_parentheses_challenge.ipynb