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.

[406, 96, 257, 366, 379, 330, 393, 91, 131, 465, 210, 135, 385, 484, 295, 201, 146, 94, 342, 205]
Output:
[406, 96, 257, 366, 379, 330, 393, 484, 131, 465, 210, 135, 385, 91, 295, 201, 146, 94, 342, 205]