     "mimetype": "text/x-python",
     "name": "python",
     "nbconvert_exporter": "python",
     "pygments_lexer": "ipython3",
     "version": "3.4.3"
    }
   },
   "nbformat": 4,
   "nbformat_minor": 0
  }
 
</s> remove     "            num_stacks = len(self.stacks)\n",
 </s> add  </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     "            self.last_stack = StackWithCapacity(None, self.capacity)\n",
 </s> add     "            self.last_stack = StackWithCapacity(None, self.indiv_stack_capacity)\n",
   "version": "3.5.0"
     "mimetype": "text/x-python",
     "name": "python",
     "nbconvert_exporter": "python",
     "pygments_lexer": "ipython3",
   "version": "3.5.0"
    }
   },
   "nbformat": 4,
   "nbformat_minor": 0
  }
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