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: [187, 400, 482, 294, 130, 167, 161, 292, 268, 153, 275, 494, 261, 475, 127, 10, 105, 310, 287, 354]

Solution: [187, 400, 482, 294, 130, 167, 161, 292, 268, 153, 275, 10, 261, 475, 127, 494, 105, 310, 287, 354]