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: [265, 209, 433, 482, 412, 249, 19, 456, 256, 334, 50, 223, 458, 135, 65, 282, 309, 405, 274, 430]

Answer: [265, 209, 433, 19, 412, 249, 482, 456, 256, 334, 50, 223, 458, 135, 65, 282, 309, 405, 274, 430]


Question: [336, 470, 324, 58, 152, 186, 335, 68, 236, 425, 331, 369, 300, 115, 376, 286, 130, 439, 426, 358]

Answer: [336, 58, 324, 470, 152, 186, 335, 68, 236, 425, 331, 369, 300, 115, 376, 286, 130, 439, 426, 358]


Question: [81, 268, 174, 47, 16, 230, 165, 137, 291, 457, 188, 413, 36, 238, 454, 284, 115, 378, 356, 135]

Answer:
[81, 268, 174, 47, 457, 230, 165, 137, 291, 16, 188, 413, 36, 238, 454, 284, 115, 378, 356, 135]