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: [224, 386, 364, 432, 468, 46, 205, 257, 308, 388, 261, 73, 402, 291, 403, 165, 147, 276, 222, 111]
Student:
[224, 386, 364, 432, 46, 468, 205, 257, 308, 388, 261, 73, 402, 291, 403, 165, 147, 276, 222, 111]