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: [192, 94, 99, 190, 320, 247, 334, 53, 177, 142, 451, 184, 496, 19, 117, 14, 265, 140, 430, 484]
Solution:
[192, 94, 99, 190, 320, 247, 334, 53, 177, 142, 451, 184, 14, 19, 117, 496, 265, 140, 430, 484]