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: [142, 384, 19, 322, 397, 411, 65, 214, 114, 75, 52, 40, 122, 337, 350, 289, 42, 236, 91, 386]
Solution:
[142, 384, 411, 322, 397, 19, 65, 214, 114, 75, 52, 40, 122, 337, 350, 289, 42, 236, 91, 386]