TASK DEFINITION: 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.
PROBLEM: [161, 38, 129, 34, 32, 387, 172, 89, 220, 189, 257, 229, 218, 43, 268, 39, 210, 411, 22, 99]

SOLUTION: [161, 38, 129, 34, 32, 387, 172, 89, 220, 189, 257, 229, 218, 43, 268, 39, 210, 22, 411, 99]

PROBLEM: [412, 382, 419, 44, 424, 49, 395, 14, 131, 181, 19, 323, 51, 494, 417, 124, 10, 206, 428, 387]

SOLUTION: [412, 382, 419, 44, 424, 49, 395, 14, 131, 181, 19, 323, 51, 10, 417, 124, 494, 206, 428, 387]

PROBLEM: [15, 294, 79, 413, 414, 445, 53, 123, 18, 459, 248, 142, 395, 351, 191, 317, 455, 358, 187, 473]

SOLUTION:
[473, 294, 79, 413, 414, 445, 53, 123, 18, 459, 248, 142, 395, 351, 191, 317, 455, 358, 187, 15]