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:
[11, 396, 382, 413, 109, 386, 294, 389, 378, 132, 230, 358, 385, 371, 176, 242, 423, 313, 436, 272]
answer:
[436, 396, 382, 413, 109, 386, 294, 389, 378, 132, 230, 358, 385, 371, 176, 242, 423, 313, 11, 272]


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:
[192, 94, 99, 190, 320, 247, 334, 53, 177, 142, 451, 184, 496, 19, 117, 14, 265, 140, 430, 484]
answer:

[192, 94, 99, 190, 320, 247, 334, 53, 177, 142, 451, 184, 14, 19, 117, 496, 265, 140, 430, 484]


