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.
--------
Question: [60, 83, 17, 71, 59, 325, 38, 236, 206, 52, 25, 399, 177, 386, 180, 123, 466, 366, 444, 237]

Answer: [60, 83, 466, 71, 59, 325, 38, 236, 206, 52, 25, 399, 177, 386, 180, 123, 17, 366, 444, 237]


Question: [371, 401, 57, 175, 193, 59, 392, 179, 313, 25, 280, 369, 173, 345, 464, 247, 132, 121, 13, 208]

Answer: [371, 401, 57, 175, 193, 59, 392, 179, 313, 25, 280, 369, 173, 345, 13, 247, 132, 121, 464, 208]


Question: [263, 328, 395, 270, 216, 437, 267, 470, 350, 435, 136, 84, 360, 427, 31, 144, 68, 188, 207, 29]

Answer:
[263, 328, 395, 270, 216, 437, 267, 29, 350, 435, 136, 84, 360, 427, 31, 144, 68, 188, 207, 470]