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: [205, 479, 343, 263, 59, 164, 372, 22, 151, 72, 446, 471, 53, 114, 307, 405, 368, 427, 498, 195]

Answer: [205, 479, 343, 263, 59, 164, 372, 498, 151, 72, 446, 471, 53, 114, 307, 405, 368, 427, 22, 195]


Question: [182, 140, 61, 425, 161, 449, 260, 475, 80, 343, 86, 395, 255, 443, 270, 196, 106, 287, 330, 431]

Answer: [182, 140, 475, 425, 161, 449, 260, 61, 80, 343, 86, 395, 255, 443, 270, 196, 106, 287, 330, 431]


Question: [307, 396, 130, 427, 133, 98, 211, 373, 108, 445, 372, 386, 278, 200, 483, 264, 101, 114, 84, 44]

Answer:
[307, 396, 130, 427, 133, 98, 211, 373, 108, 445, 372, 386, 278, 200, 44, 264, 101, 114, 84, 483]