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: [258, 62, 343, 490, 233, 496, 293, 255, 271, 334, 398, 184, 217, 305, 246, 416, 261, 118, 241, 260]

Solution: [258, 496, 343, 490, 233, 62, 293, 255, 271, 334, 398, 184, 217, 305, 246, 416, 261, 118, 241, 260]