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: [492, 388, 498, 400, 55, 351, 371, 182, 125, 231, 174, 60, 227, 398, 237, 143, 324, 252, 358, 209]

Solution: [492, 388, 55, 400, 498, 351, 371, 182, 125, 231, 174, 60, 227, 398, 237, 143, 324, 252, 358, 209]