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? If you are still confused, see the following example:
[1,45,67,43,58,98,41,34,57]
Solution: [98,45,67,43,58,1,41,34,57]
Reason: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

Now, solve this instance: [332, 68, 367, 40, 74, 273, 103, 130, 256, 381, 294, 376, 493, 307, 151, 37, 464, 456, 432, 272]
Student:
[332, 68, 367, 40, 74, 273, 103, 130, 256, 381, 294, 376, 37, 307, 151, 493, 464, 456, 432, 272]