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.

[261, 30, 36, 116, 92, 370, 295, 348, 70, 247, 286, 63, 19, 267, 111, 206, 257, 107, 461, 174]
[261, 30, 36, 116, 92, 370, 295, 348, 70, 247, 286, 63, 461, 267, 111, 206, 257, 107, 19, 174]