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: [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: [64, 35, 266, 412, 289, 233, 485, 316, 384, 425, 129, 297, 105, 74, 353, 197, 473, 89, 164, 163]

A: [64, 485, 266, 412, 289, 233, 35, 316, 384, 425, 129, 297, 105, 74, 353, 197, 473, 89, 164, 163]
****
Q: [205, 479, 343, 263, 59, 164, 372, 22, 151, 72, 446, 471, 53, 114, 307, 405, 368, 427, 498, 195]

A:
[205, 479, 343, 263, 59, 164, 372, 498, 151, 72, 446, 471, 53, 114, 307, 405, 368, 427, 22, 195]
****