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: [402, 206, 116, 203, 177, 470, 131, 168, 396, 66, 450, 225, 460, 314, 166, 426, 209, 467, 267, 389]

Solution: [402, 206, 116, 203, 177, 66, 131, 168, 396, 470, 450, 225, 460, 314, 166, 426, 209, 467, 267, 389]