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: [23, 333, 423, 428, 337, 134, 388, 129, 293, 364, 92, 246, 275, 481, 361, 393, 375, 208, 279, 127]

Answer: [481, 333, 423, 428, 337, 134, 388, 129, 293, 364, 92, 246, 275, 23, 361, 393, 375, 208, 279, 127]


Question: [15, 100, 389, 471, 129, 112, 68, 70, 423, 81, 481, 334, 67, 80, 277, 93, 387, 391, 161, 434]

Answer: [481, 100, 389, 471, 129, 112, 68, 70, 423, 81, 15, 334, 67, 80, 277, 93, 387, 391, 161, 434]


Question: [66, 42, 133, 89, 419, 355, 104, 212, 452, 198, 240, 102, 496, 199, 68, 415, 364, 88, 491, 465]

Answer:
[66, 496, 133, 89, 419, 355, 104, 212, 452, 198, 240, 102, 42, 199, 68, 415, 364, 88, 491, 465]