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: [309, 15, 457, 143, 339, 76, 32, 107, 250, 228, 185, 484, 166, 172, 415, 264, 446, 278, 314, 34]
A:
[309, 484, 457, 143, 339, 76, 32, 107, 250, 228, 185, 15, 166, 172, 415, 264, 446, 278, 314, 34]