Given an array nums and a position index, return a new array with the element at that position removed. The elements after it move one place to the left. Deletion is the reverse of insertion: instead of opening a gap, the later elements shift leftShifting LeftMoving each element one position towards the front, overwriting the element being removed. to close one. The cost again depends on position — removing near the front moves almost everything, removing the last element moves nothing.