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: [277, 412, 88, 399, 406, 323, 449, 20, 33, 443, 418, 405, 254, 224, 390, 269, 61, 146, 203, 195]
Solution:
[277, 412, 88, 399, 406, 323, 20, 449, 33, 443, 418, 405, 254, 224, 390, 269, 61, 146, 203, 195]