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.

Q: [30, 193, 300, 72, 114, 416, 41, 196, 45, 473, 181, 337, 258, 51, 128, 444, 466, 266, 310, 413]

A: [473, 193, 300, 72, 114, 416, 41, 196, 45, 30, 181, 337, 258, 51, 128, 444, 466, 266, 310, 413]
****
Q: [212, 35, 419, 307, 432, 159, 493, 38, 385, 442, 119, 328, 409, 221, 113, 330, 20, 395, 267, 259]

A: [212, 35, 419, 307, 432, 159, 20, 38, 385, 442, 119, 328, 409, 221, 113, 330, 493, 395, 267, 259]
****
Q: [352, 19, 343, 202, 392, 372, 496, 393, 355, 178, 310, 399, 183, 281, 425, 62, 76, 82, 438, 249]

A:
[352, 496, 343, 202, 392, 372, 19, 393, 355, 178, 310, 399, 183, 281, 425, 62, 76, 82, 438, 249]
****