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: [190, 43, 71, 390, 182, 235, 154, 282, 493, 69, 468, 317, 489, 132, 336, 375, 160, 432, 163, 374]

Solution: [190, 493, 71, 390, 182, 235, 154, 282, 43, 69, 468, 317, 489, 132, 336, 375, 160, 432, 163, 374]