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:
[339, 229, 429, 239, 321, 334, 115, 36, 456, 269, 402, 483, 230, 453, 378, 262, 299, 227, 238, 268]
answer:
[339, 229, 429, 239, 321, 334, 115, 483, 456, 269, 402, 36, 230, 453, 378, 262, 299, 227, 238, 268]


question:
[471, 416, 38, 475, 92, 200, 179, 165, 124, 194, 163, 55, 292, 161, 315, 177, 120, 91, 128, 29]
answer:
[471, 416, 38, 29, 92, 200, 179, 165, 124, 194, 163, 55, 292, 161, 315, 177, 120, 91, 128, 475]


question:
[47, 153, 471, 454, 207, 195, 168, 233, 408, 241, 442, 249, 36, 482, 226, 293, 170, 402, 452, 295]
answer:

[47, 153, 471, 454, 207, 195, 168, 233, 408, 241, 442, 249, 482, 36, 226, 293, 170, 402, 452, 295]


