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: [157, 434, 175, 478, 388, 418, 362, 274, 292, 343, 81, 493, 447, 146, 125, 190, 134, 468, 104, 101]
Solution:
[157, 434, 175, 478, 388, 418, 362, 274, 292, 343, 493, 81, 447, 146, 125, 190, 134, 468, 104, 101]