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.

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

[EX Q]: [77, 481, 445, 178, 275, 58, 42, 168, 92, 136, 390, 498, 133, 333, 396, 85, 243, 283, 323, 322]
[EX A]: [77, 481, 445, 178, 275, 58, 498, 168, 92, 136, 390, 42, 133, 333, 396, 85, 243, 283, 323, 322]

[EX Q]: [194, 357, 428, 137, 258, 406, 376, 68, 190, 99, 449, 220, 52, 340, 432, 88, 112, 40, 39, 326]
[EX A]:
[194, 357, 428, 137, 258, 406, 376, 68, 190, 99, 39, 220, 52, 340, 432, 88, 112, 40, 449, 326]