Given the task definition, example input & output, solve the new input case.
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]
Output: [98,45,67,43,58,1,41,34,57]
1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

New input case for you: [175, 226, 366, 453, 182, 275, 23, 361, 118, 387, 90, 312, 310, 227, 404, 230, 337, 111, 66, 420]
Output:
[175, 226, 366, 23, 182, 275, 453, 361, 118, 387, 90, 312, 310, 227, 404, 230, 337, 111, 66, 420]