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: [373, 11, 221, 335, 379, 78, 180, 303, 453, 359, 80, 298, 100, 433, 428, 96, 125, 45, 48, 139]

SOLUTION: [373, 453, 221, 335, 379, 78, 180, 303, 11, 359, 80, 298, 100, 433, 428, 96, 125, 45, 48, 139]

PROBLEM: [131, 212, 431, 43, 122, 473, 421, 142, 171, 252, 78, 68, 414, 329, 61, 283, 346, 284, 204, 381]

SOLUTION: [131, 212, 431, 473, 122, 43, 421, 142, 171, 252, 78, 68, 414, 329, 61, 283, 346, 284, 204, 381]

PROBLEM: [176, 172, 188, 385, 356, 24, 104, 497, 330, 222, 270, 266, 427, 182, 492, 224, 249, 470, 58, 391]

SOLUTION:
[176, 172, 188, 385, 356, 497, 104, 24, 330, 222, 270, 266, 427, 182, 492, 224, 249, 470, 58, 391]