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: [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: [103, 386, 52, 473, 420, 328, 316, 463, 427, 113, 384, 289, 204, 121, 100, 372, 25, 312, 34, 401]

SOLUTION: [103, 386, 52, 25, 420, 328, 316, 463, 427, 113, 384, 289, 204, 121, 100, 372, 473, 312, 34, 401]

PROBLEM: [106, 196, 137, 46, 222, 397, 497, 442, 244, 464, 481, 303, 424, 177, 390, 143, 308, 422, 473, 82]

SOLUTION:
[106, 196, 137, 497, 222, 397, 46, 442, 244, 464, 481, 303, 424, 177, 390, 143, 308, 422, 473, 82]