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: [328, 399, 81, 127, 466, 77, 360, 489, 346, 413, 406, 359, 431, 197, 26, 451, 120, 237, 443, 427]

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


Question: [331, 491, 492, 19, 382, 167, 316, 441, 341, 293, 137, 163, 311, 336, 442, 493, 77, 476, 121, 32]

Answer: [331, 491, 492, 493, 382, 167, 316, 441, 341, 293, 137, 163, 311, 336, 442, 19, 77, 476, 121, 32]


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

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


