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: [309, 15, 457, 143, 339, 76, 32, 107, 250, 228, 185, 484, 166, 172, 415, 264, 446, 278, 314, 34]

SOLUTION: [309, 484, 457, 143, 339, 76, 32, 107, 250, 228, 185, 15, 166, 172, 415, 264, 446, 278, 314, 34]

PROBLEM: [489, 53, 198, 184, 370, 132, 322, 74, 279, 186, 316, 158, 460, 25, 126, 295, 12, 57, 332, 194]

SOLUTION: [12, 53, 198, 184, 370, 132, 322, 74, 279, 186, 316, 158, 460, 25, 126, 295, 489, 57, 332, 194]

PROBLEM: [53, 400, 447, 274, 435, 432, 46, 51, 317, 404, 442, 16, 70, 190, 449, 43, 356, 156, 175, 294]

SOLUTION:
[53, 400, 447, 274, 435, 432, 46, 51, 317, 404, 442, 449, 70, 190, 16, 43, 356, 156, 175, 294]