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: [103, 386, 52, 473, 420, 328, 316, 463, 427, 113, 384, 289, 204, 121, 100, 372, 25, 312, 34, 401]
Solution:
[103, 386, 52, 25, 420, 328, 316, 463, 427, 113, 384, 289, 204, 121, 100, 372, 473, 312, 34, 401]