can someone explain this task please?
Create a function named
remove_middlewhich has three parameters named
The function should return a list where all elements in
lstwith an index between
end(inclusive) have been removed.
and why this is the solution to it:
def remove_middle(lst, start, end):
return lst[:start] + lst[end+1:]