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:[212, 35, 419, 307, 432, 159, 493, 38, 385, 442, 119, 328, 409, 221, 113, 330, 20, 395, 267, 259]
Solution:
[212, 35, 419, 307, 432, 159, 20, 38, 385, 442, 119, 328, 409, 221, 113, 330, 493, 395, 267, 259]