Teacher: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.
Teacher: Now, understand the problem? Solve this instance: [266, 446, 112, 116, 14, 309, 407, 256, 27, 109, 13, 118, 448, 412, 135, 288, 270, 158, 189, 75]
Student:
[266, 446, 112, 116, 14, 309, 407, 256, 27, 109, 448, 118, 13, 412, 135, 288, 270, 158, 189, 75]