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: [30, 193, 300, 72, 114, 416, 41, 196, 45, 473, 181, 337, 258, 51, 128, 444, 466, 266, 310, 413]
Student:
[473, 193, 300, 72, 114, 416, 41, 196, 45, 30, 181, 337, 258, 51, 128, 444, 466, 266, 310, 413]