          return sorted_stack
  
      def test_sort_stack(self):
          print('Test: Empty stack')
          sorted_stack = self.get_sorted_stack([])
          assert_equal(sorted_stack.pop(), None)
  
          print('Test: One element stack')
          sorted_stack = self.get_sorted_stack([1])
          assert_equal(sorted_stack.pop(), 1)
 
</s> remove     def test_sort_stack(self):
 </s> add     def test_sort_stack(self, stack): </s> remove         sorted_stack = self.get_sorted_stack([1])
 </s> add         sorted_stack = self.get_sorted_stack(stack, [1]) </s> remove     "        sorted_stack = self.get_sorted_stack([])\n",
 </s> add     "        sorted_stack = self.get_sorted_stack(stack, [])\n", </s> remove     "        sorted_stack = self.get_sorted_stack([])\n",
 </s> add     "        sorted_stack = self.get_sorted_stack(stack, [])\n", </s> remove     "    def test_sort_stack(self):\n",
 </s> add     "    def test_sort_stack(self, stack):\n",
        sorted_stack = self.get_sorted_stack(stack, [])
          return sorted_stack
  
      def test_sort_stack(self):
          print('Test: Empty stack')
        sorted_stack = self.get_sorted_stack(stack, [])
          assert_equal(sorted_stack.pop(), None)
  
          print('Test: One element stack')
          sorted_stack = self.get_sorted_stack([1])
          assert_equal(sorted_stack.pop(), 1)
keep keep keep keep replace keep keep keep keep keep
 Add intermediate sort stack solution and test 
stacks_queues/sort_stack/test_sort_stack.py