Detailed Instructions: 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.
See one example below:
Problem: [1,45,67,43,58,98,41,34,57]
Solution: [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.

Problem: [446, 271, 355, 181, 214, 338, 42, 398, 235, 467, 57, 92, 56, 282, 99, 222, 420, 339, 50, 472]
Solution:
[446, 271, 355, 181, 214, 338, 472, 398, 235, 467, 57, 92, 56, 282, 99, 222, 420, 339, 50, 42]