  class TestFib(object):
  
      def test_fib(self, func):
          result = []
          for i in range(num_items):
              result.append(func(i))
          fib_seq = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
          assert_equal(result, fib_seq)
          print('Success: test_fib')
  
 
</s> remove         fib_seq = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
        assert_equal(result, fib_seq)
 </s> add         assert_equal(result, expected) </s> remove     "        for i in range(num_items):\n",
 </s> add     "        expected = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n",
    "        for i in range(len(expected)):\n", </s> remove     "        for i in range(num_items):\n",
 </s> add     "        expected = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n",
    "        for i in range(len(expected)):\n", </s> remove     "        fib_seq = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n",
    "        assert_equal(result, fib_seq)\n",
 </s> add     "        assert_equal(result, expected)\n", </s> remove     "        fib_seq = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n",
    "        assert_equal(result, fib_seq)\n",
 </s> add     "        assert_equal(result, expected)\n",
        expected = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
        for i in range(len(expected)):
  class TestFib(object):
  
      def test_fib(self, func):
          result = []
        expected = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
        for i in range(len(expected)):
              result.append(func(i))
          fib_seq = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
          assert_equal(result, fib_seq)
          print('Success: test_fib')
  
keep keep keep keep replace keep keep keep keep keep
 Polish fibonacci challenge and solution (#91)

Update constraints, test cases, tests, and code. 
recursion_dynamic/fibonacci/test_fibonacci.py