      "    * Yes\n",
      "* If a stack becomes full, should automatically create one?\n",
      "    * Yes\n",
      "* If a stack becomes empty, should we delete it?\n",
      "    * Yes"
     ]
    },
    {
     "cell_type": "markdown",
 
</s> remove     "* If a stack becomes full, should we automatically create one?\n",
 </s> add     "* Are all stack bound by the same capacity?\n",
    "    * Yes\n",
    "* If a stack becomes full, should automatically create one?\n", </s> remove     "            num_stacks = len(self.stacks)\n",
 </s> add  </s> remove     "        stacks = SetOfStacks(capacity=2)\n",
 </s> add     "        stacks = SetOfStacks(indiv_stack_capacity=2)\n",
    "    * Yes\n",
    "* If we pop on an empty stack, should we return None?\n",
    "    * Yes\n",
    "* Can we assume this fits memory?\n",
      "    * Yes\n",
      "* If a stack becomes full, should automatically create one?\n",
      "    * Yes\n",
      "* If a stack becomes empty, should we delete it?\n",
    "    * Yes\n",
    "* If we pop on an empty stack, should we return None?\n",
    "    * Yes\n",
    "* Can we assume this fits memory?\n",
      "    * Yes"
     ]
    },
    {
     "cell_type": "markdown",
keep keep keep add keep keep keep keep keep
 Polish set of stacks challenge and solution (#73)

Update constraints, algorithm discussion, and code. 
stacks_queues/set_of_stacks/set_of_stacks_solution.ipynb