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: [406, 96, 257, 366, 379, 330, 393, 91, 131, 465, 210, 135, 385, 484, 295, 201, 146, 94, 342, 205]

Answer: [406, 96, 257, 366, 379, 330, 393, 484, 131, 465, 210, 135, 385, 91, 295, 201, 146, 94, 342, 205]


Question: [120, 262, 66, 174, 202, 447, 193, 188, 307, 474, 69, 100, 338, 394, 487, 145, 348, 184, 358, 149]

Answer: [120, 262, 487, 174, 202, 447, 193, 188, 307, 474, 69, 100, 338, 394, 66, 145, 348, 184, 358, 149]


Question: [311, 319, 362, 321, 22, 213, 35, 453, 117, 287, 461, 66, 234, 37, 250, 470, 108, 25, 334, 387]

Answer:
[311, 319, 362, 321, 470, 213, 35, 453, 117, 287, 461, 66, 234, 37, 250, 22, 108, 25, 334, 387]


