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: [328, 399, 81, 127, 466, 77, 360, 489, 346, 413, 406, 359, 431, 197, 26, 451, 120, 237, 443, 427]

SOLUTION: [328, 399, 81, 127, 466, 77, 360, 26, 346, 413, 406, 359, 431, 197, 489, 451, 120, 237, 443, 427]

PROBLEM: [406, 96, 257, 366, 379, 330, 393, 91, 131, 465, 210, 135, 385, 484, 295, 201, 146, 94, 342, 205]

SOLUTION: [406, 96, 257, 366, 379, 330, 393, 484, 131, 465, 210, 135, 385, 91, 295, 201, 146, 94, 342, 205]

PROBLEM: [147, 345, 70, 396, 326, 125, 55, 221, 43, 223, 122, 241, 374, 372, 487, 210, 488, 276, 308, 218]

SOLUTION:
[147, 345, 70, 396, 326, 125, 55, 221, 488, 223, 122, 241, 374, 372, 487, 210, 43, 276, 308, 218]

