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.
One example is below.
Q: [1,45,67,43,58,98,41,34,57]
A: [98,45,67,43,58,1,41,34,57]
Rationale: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.
Q: [60, 83, 17, 71, 59, 325, 38, 236, 206, 52, 25, 399, 177, 386, 180, 123, 466, 366, 444, 237]
A:
[60, 83, 466, 71, 59, 325, 38, 236, 206, 52, 25, 399, 177, 386, 180, 123, 17, 366, 444, 237]