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: [275, 398, 432, 305, 25, 124, 329, 12, 422, 466, 295, 96, 29, 365, 427, 389, 284, 397, 13, 99]

SOLUTION: [275, 398, 432, 305, 25, 124, 329, 466, 422, 12, 295, 96, 29, 365, 427, 389, 284, 397, 13, 99]

PROBLEM: [53, 400, 447, 274, 435, 432, 46, 51, 317, 404, 442, 16, 70, 190, 449, 43, 356, 156, 175, 294]

SOLUTION: [53, 400, 447, 274, 435, 432, 46, 51, 317, 404, 442, 449, 70, 190, 16, 43, 356, 156, 175, 294]

PROBLEM: [372, 297, 467, 302, 239, 498, 99, 110, 432, 442, 496, 478, 98, 458, 449, 331, 427, 175, 315, 49]

SOLUTION:
[372, 297, 467, 302, 239, 49, 99, 110, 432, 442, 496, 478, 98, 458, 449, 331, 427, 175, 315, 498]