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: [309, 15, 457, 143, 339, 76, 32, 107, 250, 228, 185, 484, 166, 172, 415, 264, 446, 278, 314, 34]

SOLUTION: [309, 484, 457, 143, 339, 76, 32, 107, 250, 228, 185, 15, 166, 172, 415, 264, 446, 278, 314, 34]

PROBLEM: [29, 411, 366, 438, 162, 117, 121, 436, 351, 344, 357, 420, 32, 464, 289, 395, 187, 132, 258, 425]

SOLUTION: [464, 411, 366, 438, 162, 117, 121, 436, 351, 344, 357, 420, 32, 29, 289, 395, 187, 132, 258, 425]

PROBLEM: [159, 271, 473, 31, 27, 126, 320, 353, 71, 432, 214, 249, 440, 266, 170, 185, 324, 398, 399, 23]

SOLUTION:
[159, 271, 23, 31, 27, 126, 320, 353, 71, 432, 214, 249, 440, 266, 170, 185, 324, 398, 399, 473]

