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: [336, 470, 324, 58, 152, 186, 335, 68, 236, 425, 331, 369, 300, 115, 376, 286, 130, 439, 426, 358]
A:
[336, 58, 324, 470, 152, 186, 335, 68, 236, 425, 331, 369, 300, 115, 376, 286, 130, 439, 426, 358]