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.

[352, 19, 343, 202, 392, 372, 496, 393, 355, 178, 310, 399, 183, 281, 425, 62, 76, 82, 438, 249]
Output:
[352, 496, 343, 202, 392, 372, 19, 393, 355, 178, 310, 399, 183, 281, 425, 62, 76, 82, 438, 249]