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: [337, 269, 373, 439, 95, 446, 50, 333, 16, 318, 259, 342, 224, 461, 52, 171, 154, 193, 395, 122]

SOLUTION: [337, 269, 373, 439, 95, 446, 50, 333, 461, 318, 259, 342, 224, 16, 52, 171, 154, 193, 395, 122]

PROBLEM: [357, 470, 83, 330, 213, 156, 286, 409, 334, 160, 316, 375, 215, 232, 468, 358, 161, 418, 25, 458]

SOLUTION: [357, 25, 83, 330, 213, 156, 286, 409, 334, 160, 316, 375, 215, 232, 468, 358, 161, 418, 470, 458]

PROBLEM: [447, 60, 249, 247, 486, 14, 193, 173, 451, 144, 12, 405, 308, 202, 132, 65, 160, 184, 348, 203]

SOLUTION:
[447, 60, 249, 247, 12, 14, 193, 173, 451, 144, 486, 405, 308, 202, 132, 65, 160, 184, 348, 203]

