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]: [190, 136, 460, 107, 184, 48, 278, 318, 27, 308, 173, 333, 281, 253, 296, 396, 299, 90, 255, 301]
[A]: [190, 136, 27, 107, 184, 48, 278, 318, 460, 308, 173, 333, 281, 253, 296, 396, 299, 90, 255, 301]


[Q]: [328, 399, 81, 127, 466, 77, 360, 489, 346, 413, 406, 359, 431, 197, 26, 451, 120, 237, 443, 427]
[A]: [328, 399, 81, 127, 466, 77, 360, 26, 346, 413, 406, 359, 431, 197, 489, 451, 120, 237, 443, 427]


[Q]: [248, 260, 272, 62, 193, 361, 439, 491, 139, 335, 351, 161, 56, 190, 51, 384, 106, 20, 385, 202]
[A]:
[248, 260, 272, 62, 193, 361, 439, 20, 139, 335, 351, 161, 56, 190, 51, 384, 106, 491, 385, 202]


