      "    def is_full(self):\n",
      "        return self.num_items == self.capacity\n",
      "\n",
      "\n",
      "class SetOfStacks(object):\n",
      "\n",
      "    def __init__(self, indiv_stack_capacity):\n",
      "        self.indiv_stack_capacity = indiv_stack_capacity\n",
      "        self.stacks = []\n",
 
</s> remove     "            self.last_stack = self.stacks[-1] \\\n",
    "                if len(self.stacks) else None\n",
 </s> add     "            self.last_stack = self.stacks[-1] if self.stacks else None\n", </s> remove     "        if not self.last_stack.num_items:\n",
 </s> add     "        if self.last_stack.is_empty():\n",
    "    def is_empty(self):\n",
    "        return self.num_items == 0\n",
    "\n",
      "    def is_full(self):\n",
      "        return self.num_items == self.capacity\n",
      "\n",
    "    def is_empty(self):\n",
    "        return self.num_items == 0\n",
    "\n",
      "\n",
      "class SetOfStacks(object):\n",
      "\n",
      "    def __init__(self, indiv_stack_capacity):\n",
      "        self.indiv_stack_capacity = indiv_stack_capacity\n",
      "        self.stacks = []\n",
keep keep add keep keep keep keep keep keep
 Update set of stacks challenge solution (#110)

Add is_empty() method, remove extra linebreak. 
stacks_queues/set_of_stacks/set_of_stacks_solution.ipynb