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: [272, 456, 486, 115, 337, 359, 195, 108, 216, 68, 421, 435, 83, 134, 348, 69, 99, 476, 427, 145]

SOLUTION: [272, 456, 68, 115, 337, 359, 195, 108, 216, 486, 421, 435, 83, 134, 348, 69, 99, 476, 427, 145]

PROBLEM: [265, 209, 433, 482, 412, 249, 19, 456, 256, 334, 50, 223, 458, 135, 65, 282, 309, 405, 274, 430]

SOLUTION: [265, 209, 433, 19, 412, 249, 482, 456, 256, 334, 50, 223, 458, 135, 65, 282, 309, 405, 274, 430]

PROBLEM: [349, 359, 358, 229, 353, 451, 233, 169, 397, 473, 420, 23, 371, 94, 96, 275, 113, 51, 178, 480]

SOLUTION:
[349, 359, 358, 229, 353, 451, 233, 169, 397, 473, 420, 480, 371, 94, 96, 275, 113, 51, 178, 23]