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: [248, 260, 272, 62, 193, 361, 439, 491, 139, 335, 351, 161, 56, 190, 51, 384, 106, 20, 385, 202]

Solution: [248, 260, 272, 62, 193, 361, 439, 20, 139, 335, 351, 161, 56, 190, 51, 384, 106, 491, 385, 202]