Detailed Instructions: 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.
Problem:[55, 409, 435, 374, 277, 460, 418, 43, 450, 399, 210, 260, 178, 289, 57, 262, 495, 499, 112, 26]
Solution:
[55, 409, 435, 374, 277, 460, 418, 43, 450, 399, 210, 260, 178, 289, 57, 262, 495, 26, 112, 499]