      "class TestSetOfStacks(object):\n",
      "\n",
      "    def test_set_of_stacks(self):\n",
      "        print('Test: Push on an empty stack')\n",
      "        stacks = SetOfStacks(capacity=2)\n",
      "        stacks.push(3)\n",
      "\n",
      "        print('Test: Push on a non-empty stack')\n",
      "        stacks.push(5)\n",
      "\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     "    def __init__(self, capacity):\n",
 </s> add     "    def __init__(self, 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",
    "        stacks = SetOfStacks(indiv_stack_capacity=2)\n",
      "class TestSetOfStacks(object):\n",
      "\n",
      "    def test_set_of_stacks(self):\n",
      "        print('Test: Push on an empty stack')\n",
    "        stacks = SetOfStacks(indiv_stack_capacity=2)\n",
      "        stacks.push(3)\n",
      "\n",
      "        print('Test: Push on a non-empty stack')\n",
      "        stacks.push(5)\n",
      "\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