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: [74, 53, 246, 327, 356, 92, 456, 452, 29, 209, 396, 463, 210, 324, 225, 89, 286, 122, 437, 118]

SOLUTION: [74, 53, 246, 327, 356, 92, 456, 452, 463, 209, 396, 29, 210, 324, 225, 89, 286, 122, 437, 118]

PROBLEM: [406, 96, 257, 366, 379, 330, 393, 91, 131, 465, 210, 135, 385, 484, 295, 201, 146, 94, 342, 205]

SOLUTION: [406, 96, 257, 366, 379, 330, 393, 484, 131, 465, 210, 135, 385, 91, 295, 201, 146, 94, 342, 205]

PROBLEM: [280, 30, 116, 130, 278, 303, 343, 230, 168, 140, 330, 216, 58, 373, 156, 94, 408, 121, 225, 212]

SOLUTION:
[280, 408, 116, 130, 278, 303, 343, 230, 168, 140, 330, 216, 58, 373, 156, 94, 30, 121, 225, 212]