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.

[175, 226, 366, 453, 182, 275, 23, 361, 118, 387, 90, 312, 310, 227, 404, 230, 337, 111, 66, 420]
Output:
[175, 226, 366, 23, 182, 275, 453, 361, 118, 387, 90, 312, 310, 227, 404, 230, 337, 111, 66, 420]