     "metadata": {},
     "source": [
      "## Solution Notebook\n",
      "\n",
      "Review the [Solution Notebook](#) for a discussion on algorithms and code solutions."
     ]
    }
   ],
   "metadata": {
    "kernelspec": {
 
</s> remove     "## Problem: Print all valid combinations of n-pairs of parentheses\n",
 </s> add     "## Problem: Print all valid combinations of n-pairs of parentheses.\n", </s> remove    "execution_count": 1,
 </s> add    "execution_count": null, </s> remove    "execution_count": 2,
 </s> add    "execution_count": null,
    "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": {},
     "source": [
      "## 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": {
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