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:[66, 42, 133, 89, 419, 355, 104, 212, 452, 198, 240, 102, 496, 199, 68, 415, 364, 88, 491, 465]
Solution:
[66, 496, 133, 89, 419, 355, 104, 212, 452, 198, 240, 102, 42, 199, 68, 415, 364, 88, 491, 465]