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:[281, 273, 442, 29, 37, 109, 31, 456, 306, 261, 269, 346, 220, 96, 371, 468, 224, 47, 377, 32]
Solution:
[281, 273, 442, 468, 37, 109, 31, 456, 306, 261, 269, 346, 220, 96, 371, 29, 224, 47, 377, 32]