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: [331, 491, 492, 19, 382, 167, 316, 441, 341, 293, 137, 163, 311, 336, 442, 493, 77, 476, 121, 32]

SOLUTION: [331, 491, 492, 493, 382, 167, 316, 441, 341, 293, 137, 163, 311, 336, 442, 19, 77, 476, 121, 32]

PROBLEM: [182, 140, 61, 425, 161, 449, 260, 475, 80, 343, 86, 395, 255, 443, 270, 196, 106, 287, 330, 431]

SOLUTION: [182, 140, 475, 425, 161, 449, 260, 61, 80, 343, 86, 395, 255, 443, 270, 196, 106, 287, 330, 431]

PROBLEM: [212, 35, 419, 307, 432, 159, 493, 38, 385, 442, 119, 328, 409, 221, 113, 330, 20, 395, 267, 259]

SOLUTION:
[212, 35, 419, 307, 432, 159, 20, 38, 385, 442, 119, 328, 409, 221, 113, 330, 493, 395, 267, 259]