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: [335, 76, 110, 107, 16, 338, 163, 223, 182, 275, 283, 344, 249, 341, 375, 216, 173, 301, 71, 200]
Solution:
[335, 76, 110, 107, 375, 338, 163, 223, 182, 275, 283, 344, 249, 341, 16, 216, 173, 301, 71, 200]