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: [222, 187, 453, 396, 322, 161, 333, 308, 241, 460, 480, 252, 442, 343, 43, 80, 132, 316, 417, 269]

SOLUTION: [222, 187, 453, 396, 322, 161, 333, 308, 241, 460, 43, 252, 442, 343, 480, 80, 132, 316, 417, 269]

PROBLEM: [464, 105, 267, 441, 38, 294, 359, 117, 236, 133, 81, 190, 465, 456, 485, 167, 474, 468, 458, 447]

SOLUTION: [464, 105, 267, 441, 485, 294, 359, 117, 236, 133, 81, 190, 465, 456, 38, 167, 474, 468, 458, 447]

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]

