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: [322, 229, 416, 465, 100, 351, 237, 310, 400, 303, 202, 290, 141, 273, 63, 72, 71, 65, 106, 305]

Solution: [322, 229, 416, 63, 100, 351, 237, 310, 400, 303, 202, 290, 141, 273, 465, 72, 71, 65, 106, 305]