Given the task definition, example input & output, solve the new input case.
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.
Example: [1,45,67,43,58,98,41,34,57]
Output: [98,45,67,43,58,1,41,34,57]
1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

New input case for you: [68, 435, 375, 284, 153, 300, 34, 85, 196, 473, 150, 345, 17, 197, 319, 156, 144, 124, 99, 406]
Output:
[68, 435, 375, 284, 153, 300, 34, 85, 196, 17, 150, 345, 473, 197, 319, 156, 144, 124, 99, 406]