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: [176, 166, 493, 27, 119, 265, 62, 317, 489, 443, 455, 488, 461, 189, 142, 351, 404, 187, 14, 182]

Solution: [176, 166, 14, 27, 119, 265, 62, 317, 489, 443, 455, 488, 461, 189, 142, 351, 404, 187, 493, 182]