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.
Q: [335, 76, 110, 107, 16, 338, 163, 223, 182, 275, 283, 344, 249, 341, 375, 216, 173, 301, 71, 200]
A: 
[335, 76, 110, 107, 375, 338, 163, 223, 182, 275, 283, 344, 249, 341, 16, 216, 173, 301, 71, 200]