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: [11, 396, 382, 413, 109, 386, 294, 389, 378, 132, 230, 358, 385, 371, 176, 242, 423, 313, 436, 272]

SOLUTION: [436, 396, 382, 413, 109, 386, 294, 389, 378, 132, 230, 358, 385, 371, 176, 242, 423, 313, 11, 272]

PROBLEM: [492, 388, 498, 400, 55, 351, 371, 182, 125, 231, 174, 60, 227, 398, 237, 143, 324, 252, 358, 209]

SOLUTION: [492, 388, 55, 400, 498, 351, 371, 182, 125, 231, 174, 60, 227, 398, 237, 143, 324, 252, 358, 209]

PROBLEM: [480, 194, 225, 247, 223, 287, 237, 418, 83, 73, 170, 91, 118, 325, 211, 62, 440, 191, 384, 442]

SOLUTION:
[62, 194, 225, 247, 223, 287, 237, 418, 83, 73, 170, 91, 118, 325, 211, 480, 440, 191, 384, 442]