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: [76, 66, 180, 140, 291, 342, 333, 13, 343, 279, 206, 292, 290, 275, 398, 258, 139, 271, 236, 21]

SOLUTION: [76, 66, 180, 140, 291, 342, 333, 398, 343, 279, 206, 292, 290, 275, 13, 258, 139, 271, 236, 21]

PROBLEM: [165, 22, 87, 424, 154, 434, 433, 149, 478, 426, 489, 275, 18, 320, 442, 318, 303, 104, 472, 29]

SOLUTION: [165, 22, 87, 424, 154, 434, 433, 149, 478, 426, 18, 275, 489, 320, 442, 318, 303, 104, 472, 29]

PROBLEM: [262, 28, 30, 382, 287, 474, 413, 349, 356, 15, 202, 313, 86, 17, 204, 306, 229, 227, 247, 47]

SOLUTION:
[262, 28, 30, 382, 287, 15, 413, 349, 356, 474, 202, 313, 86, 17, 204, 306, 229, 227, 247, 47]