You will be given a definition of a task first, then some input of the task.
In this task, you are given a list of unique integers you need to swap the positions of maximum and minimum element in the list and return the updated list.

[114, 363, 306, 103, 146, 131, 217, 420, 350, 66, 195, 442, 313, 153, 235, 18, 127, 204, 247, 291]
Output:
[114, 363, 306, 103, 146, 131, 217, 420, 350, 66, 195, 18, 313, 153, 235, 442, 127, 204, 247, 291]