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: [459, 172, 489, 263, 163, 437, 246, 265, 466, 146, 332, 350, 236, 401, 467, 104, 130, 230, 468, 74]

SOLUTION: [459, 172, 74, 263, 163, 437, 246, 265, 466, 146, 332, 350, 236, 401, 467, 104, 130, 230, 468, 489]

PROBLEM: [194, 357, 428, 137, 258, 406, 376, 68, 190, 99, 449, 220, 52, 340, 432, 88, 112, 40, 39, 326]

SOLUTION: [194, 357, 428, 137, 258, 406, 376, 68, 190, 99, 39, 220, 52, 340, 432, 88, 112, 40, 449, 326]

PROBLEM: [261, 30, 36, 116, 92, 370, 295, 348, 70, 247, 286, 63, 19, 267, 111, 206, 257, 107, 461, 174]

SOLUTION:
[261, 30, 36, 116, 92, 370, 295, 348, 70, 247, 286, 63, 461, 267, 111, 206, 257, 107, 19, 174]