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: [248, 260, 272, 62, 193, 361, 439, 491, 139, 335, 351, 161, 56, 190, 51, 384, 106, 20, 385, 202]

SOLUTION: [248, 260, 272, 62, 193, 361, 439, 20, 139, 335, 351, 161, 56, 190, 51, 384, 106, 491, 385, 202]

PROBLEM: [261, 30, 36, 116, 92, 370, 295, 348, 70, 247, 286, 63, 19, 267, 111, 206, 257, 107, 461, 174]

SOLUTION: [261, 30, 36, 116, 92, 370, 295, 348, 70, 247, 286, 63, 461, 267, 111, 206, 257, 107, 19, 174]

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]