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: [212, 178, 219, 360, 369, 19, 487, 129, 313, 97, 284, 476, 253, 23, 359, 238, 419, 371, 174, 434]

SOLUTION: [212, 178, 219, 360, 369, 487, 19, 129, 313, 97, 284, 476, 253, 23, 359, 238, 419, 371, 174, 434]

PROBLEM: [97, 471, 102, 181, 390, 449, 261, 403, 413, 363, 26, 172, 113, 55, 74, 414, 422, 175, 433, 266]

SOLUTION: [97, 26, 102, 181, 390, 449, 261, 403, 413, 363, 471, 172, 113, 55, 74, 414, 422, 175, 433, 266]

PROBLEM: [335, 387, 238, 71, 92, 382, 227, 348, 383, 475, 117, 181, 345, 288, 23, 397, 39, 273, 343, 202]

SOLUTION:
[335, 387, 238, 71, 92, 382, 227, 348, 383, 23, 117, 181, 345, 288, 475, 397, 39, 273, 343, 202]