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, 298, 54, 206, 237, 485, 440, 282, 247, 450, 28, 280, 474, 496, 379, 390, 392, 217, 422, 165]
Solution:
[157, 298, 54, 206, 237, 485, 440, 282, 247, 450, 496, 280, 474, 28, 379, 390, 392, 217, 422, 165]