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: [33, 439, 485, 138, 228, 443, 339, 421, 118, 21, 215, 182, 220, 265, 186, 153, 160, 43, 213, 256]

SOLUTION: [33, 439, 21, 138, 228, 443, 339, 421, 118, 485, 215, 182, 220, 265, 186, 153, 160, 43, 213, 256]

PROBLEM: [116, 179, 154, 304, 278, 217, 92, 479, 371, 145, 273, 61, 369, 135, 206, 115, 182, 212, 269, 63]

SOLUTION: [116, 179, 154, 304, 278, 217, 92, 61, 371, 145, 273, 479, 369, 135, 206, 115, 182, 212, 269, 63]

PROBLEM: [133, 356, 66, 449, 397, 410, 374, 329, 279, 40, 169, 82, 75, 19, 186, 65, 61, 414, 243, 30]

SOLUTION:
[133, 356, 66, 19, 397, 410, 374, 329, 279, 40, 169, 82, 75, 449, 186, 65, 61, 414, 243, 30]