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: [378, 396, 254, 444, 434, 114, 369, 100, 122, 360, 312, 385, 165, 387, 416, 321, 374, 341, 69, 76]
Solution: [378, 396, 254, 69, 434, 114, 369, 100, 122, 360, 312, 385, 165, 387, 416, 321, 374, 341, 444, 76]