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: [115, 431, 65, 400, 54, 160, 43, 40, 372, 125, 495, 481, 180, 484, 35, 230, 466, 20, 375, 252]

SOLUTION: [115, 431, 65, 400, 54, 160, 43, 40, 372, 125, 20, 481, 180, 484, 35, 230, 466, 495, 375, 252]

PROBLEM: [221, 493, 17, 466, 353, 191, 141, 343, 347, 247, 78, 110, 342, 228, 492, 392, 61, 106, 104, 113]

SOLUTION: [221, 17, 493, 466, 353, 191, 141, 343, 347, 247, 78, 110, 342, 228, 492, 392, 61, 106, 104, 113]

PROBLEM: [332, 397, 20, 176, 157, 58, 415, 67, 299, 201, 250, 295, 417, 310, 302, 132, 138, 117, 440, 315]

SOLUTION:
[332, 397, 440, 176, 157, 58, 415, 67, 299, 201, 250, 295, 417, 310, 302, 132, 138, 117, 20, 315]