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: [463, 157, 394, 291, 236, 444, 476, 438, 339, 215, 398, 198, 326, 134, 195, 249, 239, 482, 268, 368]
Student:
[463, 157, 394, 291, 236, 444, 476, 438, 339, 215, 398, 198, 326, 482, 195, 249, 239, 134, 268, 368]