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: [30, 193, 300, 72, 114, 416, 41, 196, 45, 473, 181, 337, 258, 51, 128, 444, 466, 266, 310, 413]
Solution:
[473, 193, 300, 72, 114, 416, 41, 196, 45, 30, 181, 337, 258, 51, 128, 444, 466, 266, 310, 413]