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: [116, 179, 154, 304, 278, 217, 92, 479, 371, 145, 273, 61, 369, 135, 206, 115, 182, 212, 269, 63]

Solution: [116, 179, 154, 304, 278, 217, 92, 61, 371, 145, 273, 479, 369, 135, 206, 115, 182, 212, 269, 63]