      "    * Yes\n",
      "* Can we assume we already have a stack class that can be used for this problem?\n",
      "    * Yes"
     ]
    },
    {
 
</s> remove     "            while not buff.is_empty() and buff.peek() > temp:\n",
 </s> add     "            while not buff.is_empty() and temp < buff.peek():\n", </s> remove     "                while not buff.is_empty() and buff.peek() > temp:\n",
 </s> add     "                while not buff.is_empty() and temp < buff.peek():\n", </s> remove     "%run ../stack/stack.py\n",
    "%load ../stack/stack.py"
 </s> add     "%run ../stack/stack.py" </s> remove    "version": "3.4.3"
 </s> add    "version": "3.5.0"
    "    * Yes\n",
    "* Can we assume this fits memory?\n",
      "    * Yes\n",
      "* Can we assume we already have a stack class that can be used for this problem?\n",
    "    * Yes\n",
    "* Can we assume this fits memory?\n",
      "    * Yes"
     ]
    },
    {
keep add keep keep keep keep
 Update stack min challenge (#108)

Updates constraints and solution. 
stacks_queues/sort_stack/sort_stack_solution.ipynb