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: [488, 495, 268, 140, 130, 379, 67, 298, 407, 250, 449, 74, 499, 465, 66, 426, 215, 43, 251, 374]

SOLUTION: [488, 495, 268, 140, 130, 379, 67, 298, 407, 250, 449, 74, 43, 465, 66, 426, 215, 499, 251, 374]

PROBLEM: [147, 166, 285, 83, 18, 144, 240, 153, 15, 161, 168, 288, 415, 492, 155, 493, 165, 85, 110, 447]

SOLUTION: [147, 166, 285, 83, 18, 144, 240, 153, 493, 161, 168, 288, 415, 492, 155, 15, 165, 85, 110, 447]

PROBLEM: [79, 333, 195, 449, 374, 267, 294, 64, 344, 237, 433, 385, 315, 185, 66, 473, 359, 265, 469, 120]

SOLUTION:
[79, 333, 195, 449, 374, 267, 294, 473, 344, 237, 433, 385, 315, 185, 66, 64, 359, 265, 469, 120]