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: [347, 362, 411, 393, 124, 247, 476, 248, 339, 363, 176, 401, 138, 388, 379, 291, 389, 455, 87, 263]
A:
[347, 362, 411, 393, 124, 247, 87, 248, 339, 363, 176, 401, 138, 388, 379, 291, 389, 455, 476, 263]