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.

[459, 172, 489, 263, 163, 437, 246, 265, 466, 146, 332, 350, 236, 401, 467, 104, 130, 230, 468, 74]
Output:
[459, 172, 74, 263, 163, 437, 246, 265, 466, 146, 332, 350, 236, 401, 467, 104, 130, 230, 468, 489]