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: [47, 153, 471, 454, 207, 195, 168, 233, 408, 241, 442, 249, 36, 482, 226, 293, 170, 402, 452, 295]
A:
[47, 153, 471, 454, 207, 195, 168, 233, 408, 241, 442, 249, 482, 36, 226, 293, 170, 402, 452, 295]