You will be given a definition of a task first, then an example. Follow the example to solve a new instance 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.

[1,45,67,43,58,98,41,34,57]
Solution: [98,45,67,43,58,1,41,34,57]
Why? 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

New input: [212, 35, 419, 307, 432, 159, 493, 38, 385, 442, 119, 328, 409, 221, 113, 330, 20, 395, 267, 259]
Solution:
[212, 35, 419, 307, 432, 159, 20, 38, 385, 442, 119, 328, 409, 221, 113, 330, 493, 395, 267, 259]