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.

[Q]: [332, 68, 367, 40, 74, 273, 103, 130, 256, 381, 294, 376, 493, 307, 151, 37, 464, 456, 432, 272]
[A]: [332, 68, 367, 40, 74, 273, 103, 130, 256, 381, 294, 376, 37, 307, 151, 493, 464, 456, 432, 272]


[Q]: [339, 229, 429, 239, 321, 334, 115, 36, 456, 269, 402, 483, 230, 453, 378, 262, 299, 227, 238, 268]
[A]: [339, 229, 429, 239, 321, 334, 115, 483, 456, 269, 402, 36, 230, 453, 378, 262, 299, 227, 238, 268]


[Q]: [25, 266, 227, 468, 309, 322, 381, 155, 271, 86, 284, 469, 108, 499, 389, 184, 464, 384, 198, 352]
[A]:
[499, 266, 227, 468, 309, 322, 381, 155, 271, 86, 284, 469, 108, 25, 389, 184, 464, 384, 198, 352]