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: [161, 38, 129, 34, 32, 387, 172, 89, 220, 189, 257, 229, 218, 43, 268, 39, 210, 411, 22, 99]

A: [161, 38, 129, 34, 32, 387, 172, 89, 220, 189, 257, 229, 218, 43, 268, 39, 210, 22, 411, 99]
****
Q: [221, 493, 17, 466, 353, 191, 141, 343, 347, 247, 78, 110, 342, 228, 492, 392, 61, 106, 104, 113]

A: [221, 17, 493, 466, 353, 191, 141, 343, 347, 247, 78, 110, 342, 228, 492, 392, 61, 106, 104, 113]
****
Q: [142, 384, 19, 322, 397, 411, 65, 214, 114, 75, 52, 40, 122, 337, 350, 289, 42, 236, 91, 386]

A:
[142, 384, 411, 322, 397, 19, 65, 214, 114, 75, 52, 40, 122, 337, 350, 289, 42, 236, 91, 386]
****