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: [412, 382, 419, 44, 424, 49, 395, 14, 131, 181, 19, 323, 51, 494, 417, 124, 10, 206, 428, 387]
Solution:
[412, 382, 419, 44, 424, 49, 395, 14, 131, 181, 19, 323, 51, 10, 417, 124, 494, 206, 428, 387]