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: [72, 413, 263, 368, 213, 59, 15, 109, 330, 249, 419, 73, 267, 485, 499, 353, 210, 476, 118, 339]
A:
[72, 413, 263, 368, 213, 59, 499, 109, 330, 249, 419, 73, 267, 485, 15, 353, 210, 476, 118, 339]