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: [66, 42, 133, 89, 419, 355, 104, 212, 452, 198, 240, 102, 496, 199, 68, 415, 364, 88, 491, 465]

SOLUTION: [66, 496, 133, 89, 419, 355, 104, 212, 452, 198, 240, 102, 42, 199, 68, 415, 364, 88, 491, 465]

PROBLEM: [489, 53, 198, 184, 370, 132, 322, 74, 279, 186, 316, 158, 460, 25, 126, 295, 12, 57, 332, 194]

SOLUTION: [12, 53, 198, 184, 370, 132, 322, 74, 279, 186, 316, 158, 460, 25, 126, 295, 489, 57, 332, 194]

PROBLEM: [146, 354, 466, 465, 481, 390, 64, 176, 347, 420, 459, 386, 299, 468, 15, 161, 18, 422, 300, 188]

SOLUTION:
[146, 354, 466, 465, 15, 390, 64, 176, 347, 420, 459, 386, 299, 468, 481, 161, 18, 422, 300, 188]

