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: [262, 28, 30, 382, 287, 474, 413, 349, 356, 15, 202, 313, 86, 17, 204, 306, 229, 227, 247, 47]

A: [262, 28, 30, 382, 287, 15, 413, 349, 356, 474, 202, 313, 86, 17, 204, 306, 229, 227, 247, 47]
****
Q: [114, 363, 306, 103, 146, 131, 217, 420, 350, 66, 195, 442, 313, 153, 235, 18, 127, 204, 247, 291]

A: [114, 363, 306, 103, 146, 131, 217, 420, 350, 66, 195, 18, 313, 153, 235, 442, 127, 204, 247, 291]
****
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]
****