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.
Example: [1,45,67,43,58,98,41,34,57]
Example solution: [98,45,67,43,58,1,41,34,57]
Example explanation: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

Problem: [373, 11, 221, 335, 379, 78, 180, 303, 453, 359, 80, 298, 100, 433, 428, 96, 125, 45, 48, 139]

Solution: [373, 453, 221, 335, 379, 78, 180, 303, 11, 359, 80, 298, 100, 433, 428, 96, 125, 45, 48, 139]