      "def insertion_sort(data):\n",
      "    if data is None or len(data) < 2:\n",
      "        return\n",
      "    for r in range(1, len(data)):\n",
      "        for l in range(0, r):\n",
      "            if data[l] > data[r]:\n",
      "                temp = data[r]\n",
      "                data[l+1:r+1] = data[l:r]\n",
      "                data[l] = temp\n",
      "                break"
 
</s> remove    "version": "3.4.3"
 </s> add    "version": "3.5.0" </s> remove    "version": "3.4.3"
 </s> add    "version": "3.5.0"
    "        for l in range(r):\n",
      "def insertion_sort(data):\n",
      "    if data is None or len(data) < 2:\n",
      "        return\n",
      "    for r in range(1, len(data)):\n",
    "        for l in range(r):\n",
      "            if data[l] > data[r]:\n",
      "                temp = data[r]\n",
      "                data[l+1:r+1] = data[l:r]\n",
      "                data[l] = temp\n",
      "                break"
keep keep keep keep replace keep keep keep keep keep
 Polish insertion sort challenge and solution

Update constraints and code. 
sorting_searching/insertion_sort/insertion_sort_solution.ipynb