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: [96, 406, 483, 91, 481, 420, 105, 352, 441, 422, 116, 57, 74, 100, 97, 103, 166, 64, 401, 408]
Solution:
[96, 406, 57, 91, 481, 420, 105, 352, 441, 422, 116, 483, 74, 100, 97, 103, 166, 64, 401, 408]