      "## Constraints\n",
      "\n",
      "* Can we assume we already have a stack class that can be used for this problem?\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",
 
</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     "        stacks = SetOfStacks(capacity=2)\n",
 </s> add     "        stacks = SetOfStacks(indiv_stack_capacity=2)\n", </s> remove     "* Space: O(m), where m is the size of the new stack\n",
 </s> add     "* Space: O(m), where m is the size of the new stack if the last stack is full\n",
    "* Are all stack bound by the same capacity?\n",
    "    * Yes\n",
      "## Constraints\n",
      "\n",
      "* Can we assume we already have a stack class that can be used for this problem?\n",
      "    * Yes\n",
    "* Are all stack bound by the same capacity?\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",
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_challenge.ipynb