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: [227, 268, 136, 332, 349, 445, 83, 444, 359, 52, 403, 258, 263, 405, 431, 86, 287, 446, 126, 105]

SOLUTION: [227, 268, 136, 332, 349, 445, 83, 444, 359, 446, 403, 258, 263, 405, 431, 86, 287, 52, 126, 105]

PROBLEM: [190, 136, 460, 107, 184, 48, 278, 318, 27, 308, 173, 333, 281, 253, 296, 396, 299, 90, 255, 301]

SOLUTION: [190, 136, 27, 107, 184, 48, 278, 318, 460, 308, 173, 333, 281, 253, 296, 396, 299, 90, 255, 301]

PROBLEM: [103, 386, 52, 473, 420, 328, 316, 463, 427, 113, 384, 289, 204, 121, 100, 372, 25, 312, 34, 401]

SOLUTION:
[103, 386, 52, 25, 420, 328, 316, 463, 427, 113, 384, 289, 204, 121, 100, 372, 473, 312, 34, 401]