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: [360, 195, 110, 450, 104, 17, 156, 344, 274, 289, 100, 277, 245, 381, 248, 172, 73, 238, 253, 357]

SOLUTION: [360, 195, 110, 17, 104, 450, 156, 344, 274, 289, 100, 277, 245, 381, 248, 172, 73, 238, 253, 357]

PROBLEM: [477, 200, 377, 405, 450, 137, 333, 139, 195, 52, 445, 154, 61, 63, 441, 455, 308, 354, 19, 340]

SOLUTION: [19, 200, 377, 405, 450, 137, 333, 139, 195, 52, 445, 154, 61, 63, 441, 455, 308, 354, 477, 340]

PROBLEM: [244, 406, 385, 314, 323, 281, 46, 121, 195, 148, 124, 452, 414, 24, 296, 458, 301, 283, 293, 400]

SOLUTION:
[244, 406, 385, 314, 323, 281, 46, 121, 195, 148, 124, 452, 414, 458, 296, 24, 301, 283, 293, 400]