instruction:
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.
question:
[55, 409, 435, 374, 277, 460, 418, 43, 450, 399, 210, 260, 178, 289, 57, 262, 495, 499, 112, 26]
answer:
[55, 409, 435, 374, 277, 460, 418, 43, 450, 399, 210, 260, 178, 289, 57, 262, 495, 26, 112, 499]


question:
[140, 445, 344, 121, 328, 36, 73, 139, 244, 416, 309, 192, 319, 134, 412, 93, 195, 355, 76, 279]
answer:
[140, 36, 344, 121, 328, 445, 73, 139, 244, 416, 309, 192, 319, 134, 412, 93, 195, 355, 76, 279]


question:
[182, 140, 61, 425, 161, 449, 260, 475, 80, 343, 86, 395, 255, 443, 270, 196, 106, 287, 330, 431]
answer:

[182, 140, 475, 425, 161, 449, 260, 61, 80, 343, 86, 395, 255, 443, 270, 196, 106, 287, 330, 431]