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.
One example: [1,45,67,43,58,98,41,34,57]
Solution is here: [98,45,67,43,58,1,41,34,57]
Explanation: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

Now, solve this: [357, 126, 185, 18, 459, 254, 454, 404, 377, 134, 445, 209, 135, 462, 251, 23, 270, 40, 302, 19]
Solution:
[357, 126, 185, 462, 459, 254, 454, 404, 377, 134, 445, 209, 135, 18, 251, 23, 270, 40, 302, 19]