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: [282, 38, 402, 29, 79, 187, 434, 308, 398, 386, 470, 358, 266, 214, 145, 115, 380, 66, 20, 136]

SOLUTION: [282, 38, 402, 29, 79, 187, 434, 308, 398, 386, 20, 358, 266, 214, 145, 115, 380, 66, 470, 136]

PROBLEM: [309, 15, 457, 143, 339, 76, 32, 107, 250, 228, 185, 484, 166, 172, 415, 264, 446, 278, 314, 34]

SOLUTION: [309, 484, 457, 143, 339, 76, 32, 107, 250, 228, 185, 15, 166, 172, 415, 264, 446, 278, 314, 34]

PROBLEM: [444, 80, 22, 47, 182, 429, 316, 131, 432, 75, 342, 474, 442, 495, 212, 59, 354, 346, 242, 71]

SOLUTION:
[444, 80, 495, 47, 182, 429, 316, 131, 432, 75, 342, 474, 442, 22, 212, 59, 354, 346, 242, 71]