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: [16, 395, 336, 73, 197, 130, 372, 150, 282, 146, 68, 127, 244, 444, 94, 285, 231, 375, 341, 373]
A:
[444, 395, 336, 73, 197, 130, 372, 150, 282, 146, 68, 127, 244, 16, 94, 285, 231, 375, 341, 373]