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: [205, 479, 343, 263, 59, 164, 372, 22, 151, 72, 446, 471, 53, 114, 307, 405, 368, 427, 498, 195]
A:
[205, 479, 343, 263, 59, 164, 372, 498, 151, 72, 446, 471, 53, 114, 307, 405, 368, 427, 22, 195]