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: [41, 462, 109, 353, 276, 318, 95, 383, 102, 150, 229, 211, 114, 118, 288, 113, 249, 107, 320, 368]

A: [462, 41, 109, 353, 276, 318, 95, 383, 102, 150, 229, 211, 114, 118, 288, 113, 249, 107, 320, 368]
****
Q: [265, 475, 341, 442, 418, 161, 53, 69, 485, 331, 436, 450, 144, 455, 98, 488, 333, 273, 221, 51]

A: [265, 475, 341, 442, 418, 161, 53, 69, 485, 331, 436, 450, 144, 455, 98, 51, 333, 273, 221, 488]
****
Q: [335, 76, 110, 107, 16, 338, 163, 223, 182, 275, 283, 344, 249, 341, 375, 216, 173, 301, 71, 200]

A:
[335, 76, 110, 107, 375, 338, 163, 223, 182, 275, 283, 344, 249, 341, 16, 216, 173, 301, 71, 200]
****
