      "\n",
      "\n",
      "class SetOfStacks(object):\n",
      "\n",
      "    def __init__(self, capacity):\n",
      "        # TODO: Implement me\n",
      "        pass\n",
      "\n",
      "    def push(self, data):\n",
      "        # TODO: Implement me\n",
 
</s> remove     "    def __init__(self, capacity):\n",
    "        self.capacity = capacity\n",
 </s> add     "    def __init__(self, indiv_stack_capacity):\n",
    "        self.indiv_stack_capacity = indiv_stack_capacity\n", </s> remove     "            self.last_stack = StackWithCapacity(None, self.capacity)\n",
 </s> add     "            self.last_stack = StackWithCapacity(None, self.indiv_stack_capacity)\n", </s> remove     "        stacks = SetOfStacks(capacity=2)\n",
 </s> add     "        stacks = SetOfStacks(indiv_stack_capacity=2)\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",
    "    def __init__(self, indiv_stack_capacity):\n",
      "\n",
      "\n",
      "class SetOfStacks(object):\n",
      "\n",
    "    def __init__(self, indiv_stack_capacity):\n",
      "        # TODO: Implement me\n",
      "        pass\n",
      "\n",
      "    def push(self, data):\n",
      "        # TODO: Implement me\n",
keep keep keep keep replace 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