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]: [131, 212, 431, 43, 122, 473, 421, 142, 171, 252, 78, 68, 414, 329, 61, 283, 346, 284, 204, 381]
[A]: [131, 212, 431, 473, 122, 43, 421, 142, 171, 252, 78, 68, 414, 329, 61, 283, 346, 284, 204, 381]

[Q]: [339, 40, 321, 337, 489, 221, 228, 415, 267, 120, 408, 287, 363, 317, 99, 193, 262, 474, 448, 443]
[A]: [339, 489, 321, 337, 40, 221, 228, 415, 267, 120, 408, 287, 363, 317, 99, 193, 262, 474, 448, 443]

[Q]: [176, 53, 364, 186, 192, 406, 144, 349, 275, 354, 397, 60, 161, 311, 369, 342, 170, 248, 252, 472]
[A]:
[176, 472, 364, 186, 192, 406, 144, 349, 275, 354, 397, 60, 161, 311, 369, 342, 170, 248, 252, 53]